{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XSKUKNVTMYVOIMGGVY7SF54XZO","short_pith_number":"pith:XSKUKNVT","schema_version":"1.0","canonical_sha256":"bc954536b3662ae430c6ae3f22f797cbb5e9d7cdd813009f3fb9f313a3ef351c","source":{"kind":"arxiv","id":"1907.09575","version":1},"attestation_state":"computed","paper":{"title":"A 2D Parallel Triangle Counting Algorithm for Distributed-Memory Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ancy Sarah Tom, George Karypis","submitted_at":"2019-07-22T21:08:39Z","abstract_excerpt":"Triangle counting is a fundamental graph analytic operation that is used extensively in network science and graph mining. As the size of the graphs that needs to be analyzed continues to grow, there is a requirement in developing scalable algorithms for distributed-memory parallel systems. To this end, we present a distributed-memory triangle counting algorithm, which uses a 2D cyclic decomposition to balance the computations and reduce the communication overheads. The algorithm structures its communication and computational steps such that it reduces its memory overhead and includes key optim"},"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":"1907.09575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-22T21:08:39Z","cross_cats_sorted":[],"title_canon_sha256":"f5a4c1acc9d2f4232ba1a83c5c0a48374122742b002dad80aed0810626fbb387","abstract_canon_sha256":"806b5f86106a85f28a4445b609b415fdbf7bc4767f5a0ed179770402bbcb2981"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:52.873630Z","signature_b64":"DODQJVLISFcSyfw3jsXiZh84zJh6yxxO9TLzT/EEOmoTqxGw2B+T5c+yFD4edkjrolFL0UgZZLHhnF0HE+b/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc954536b3662ae430c6ae3f22f797cbb5e9d7cdd813009f3fb9f313a3ef351c","last_reissued_at":"2026-05-17T23:39:52.873134Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:52.873134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2D Parallel Triangle Counting Algorithm for Distributed-Memory Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ancy Sarah Tom, George Karypis","submitted_at":"2019-07-22T21:08:39Z","abstract_excerpt":"Triangle counting is a fundamental graph analytic operation that is used extensively in network science and graph mining. As the size of the graphs that needs to be analyzed continues to grow, there is a requirement in developing scalable algorithms for distributed-memory parallel systems. To this end, we present a distributed-memory triangle counting algorithm, which uses a 2D cyclic decomposition to balance the computations and reduce the communication overheads. The algorithm structures its communication and computational steps such that it reduces its memory overhead and includes key optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09575","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":""},"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":"1907.09575","created_at":"2026-05-17T23:39:52.873202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09575v1","created_at":"2026-05-17T23:39:52.873202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09575","created_at":"2026-05-17T23:39:52.873202+00:00"},{"alias_kind":"pith_short_12","alias_value":"XSKUKNVTMYVO","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XSKUKNVTMYVOIMGG","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XSKUKNVT","created_at":"2026-05-18T12:33:33.725879+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/XSKUKNVTMYVOIMGGVY7SF54XZO","json":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO.json","graph_json":"https://pith.science/api/pith-number/XSKUKNVTMYVOIMGGVY7SF54XZO/graph.json","events_json":"https://pith.science/api/pith-number/XSKUKNVTMYVOIMGGVY7SF54XZO/events.json","paper":"https://pith.science/paper/XSKUKNVT"},"agent_actions":{"view_html":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO","download_json":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO.json","view_paper":"https://pith.science/paper/XSKUKNVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09575&json=true","fetch_graph":"https://pith.science/api/pith-number/XSKUKNVTMYVOIMGGVY7SF54XZO/graph.json","fetch_events":"https://pith.science/api/pith-number/XSKUKNVTMYVOIMGGVY7SF54XZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/action/storage_attestation","attest_author":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/action/author_attestation","sign_citation":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/action/citation_signature","submit_replication":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/action/replication_record"}},"created_at":"2026-05-17T23:39:52.873202+00:00","updated_at":"2026-05-17T23:39:52.873202+00:00"}