{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JI75O2XGYAFOYXTJPW4YR3TVSV","short_pith_number":"pith:JI75O2XG","schema_version":"1.0","canonical_sha256":"4a3fd76ae6c00aec5e697db988ee759567752885d20f4c34ffd4d7363ff03180","source":{"kind":"arxiv","id":"1908.10550","version":1},"attestation_state":"computed","paper":{"title":"Streaming and Batch Algorithms for Truss Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"George Karypis, Venkata Rohit Jakkula","submitted_at":"2019-08-28T05:02:18Z","abstract_excerpt":"Truss decomposition is a method used to analyze large sparse graphs in order to identify successively better connected subgraphs. Since in many domains the underlying graph changes over time, its associated truss decomposition needs to be updated as well. This work focuses on the problem of incrementally updating an existing truss decomposition and makes the following three significant contributions. First, it presents a theory that identifies how the truss decomposition can change as new edges get added. Second, it develops an efficient incremental algorithm that incorporates various optimiza"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.10550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-28T05:02:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a26b2d25507bb499f1c07817c11a14baa199ae82882427d2ed196d5be056e3bf","abstract_canon_sha256":"df14c70f08b15457f703cd8cfd7f0ff9b021561832c72e62f9f4469c12646786"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:18.334537Z","signature_b64":"BfulAUYZyLSk+LUHh4iig8ij2D8pFgNbmKUcGRWJ4AI3ovv//mOFLeutVdyJiiAOfgsX+uRmNwgWmU7UaL7gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a3fd76ae6c00aec5e697db988ee759567752885d20f4c34ffd4d7363ff03180","last_reissued_at":"2026-07-05T00:00:18.334022Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:18.334022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Streaming and Batch Algorithms for Truss Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"George Karypis, Venkata Rohit Jakkula","submitted_at":"2019-08-28T05:02:18Z","abstract_excerpt":"Truss decomposition is a method used to analyze large sparse graphs in order to identify successively better connected subgraphs. Since in many domains the underlying graph changes over time, its associated truss decomposition needs to be updated as well. This work focuses on the problem of incrementally updating an existing truss decomposition and makes the following three significant contributions. First, it presents a theory that identifies how the truss decomposition can change as new edges get added. Second, it develops an efficient incremental algorithm that incorporates various optimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10550","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.10550/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.10550","created_at":"2026-07-05T00:00:18.334073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.10550v1","created_at":"2026-07-05T00:00:18.334073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10550","created_at":"2026-07-05T00:00:18.334073+00:00"},{"alias_kind":"pith_short_12","alias_value":"JI75O2XGYAFO","created_at":"2026-07-05T00:00:18.334073+00:00"},{"alias_kind":"pith_short_16","alias_value":"JI75O2XGYAFOYXTJ","created_at":"2026-07-05T00:00:18.334073+00:00"},{"alias_kind":"pith_short_8","alias_value":"JI75O2XG","created_at":"2026-07-05T00:00:18.334073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV","json":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV.json","graph_json":"https://pith.science/api/pith-number/JI75O2XGYAFOYXTJPW4YR3TVSV/graph.json","events_json":"https://pith.science/api/pith-number/JI75O2XGYAFOYXTJPW4YR3TVSV/events.json","paper":"https://pith.science/paper/JI75O2XG"},"agent_actions":{"view_html":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV","download_json":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV.json","view_paper":"https://pith.science/paper/JI75O2XG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.10550&json=true","fetch_graph":"https://pith.science/api/pith-number/JI75O2XGYAFOYXTJPW4YR3TVSV/graph.json","fetch_events":"https://pith.science/api/pith-number/JI75O2XGYAFOYXTJPW4YR3TVSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV/action/storage_attestation","attest_author":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV/action/author_attestation","sign_citation":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV/action/citation_signature","submit_replication":"https://pith.science/pith/JI75O2XGYAFOYXTJPW4YR3TVSV/action/replication_record"}},"created_at":"2026-07-05T00:00:18.334073+00:00","updated_at":"2026-07-05T00:00:18.334073+00:00"}