{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XSKUKNVTMYVOIMGGVY7SF54XZO","short_pith_number":"pith:XSKUKNVT","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"},"canonical_sha256":"bc954536b3662ae430c6ae3f22f797cbb5e9d7cdd813009f3fb9f313a3ef351c","source":{"kind":"arxiv","id":"1907.09575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09575","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09575v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09575","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"XSKUKNVTMYVO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XSKUKNVTMYVOIMGG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XSKUKNVT","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XSKUKNVTMYVOIMGGVY7SF54XZO","target":"record","payload":{"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"},"canonical_sha256":"bc954536b3662ae430c6ae3f22f797cbb5e9d7cdd813009f3fb9f313a3ef351c","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"},"source_kind":"arxiv","source_id":"1907.09575","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pOcg2ilCTozlXkZuS6YWlTY09cdWm0hwFvPvClv/vY01kuu9662ZRoOH85y3k9l7gUT76fezeBf2k9CV8NqTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:49:38.861971Z"},"content_sha256":"7f333f922141b94434be1c99e9c2a63c1644052ace80ae63e8224d3e97c0021d","schema_version":"1.0","event_id":"sha256:7f333f922141b94434be1c99e9c2a63c1644052ace80ae63e8224d3e97c0021d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XSKUKNVTMYVOIMGGVY7SF54XZO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JH4sx+arso6N4xFWC8ZuU1opVIDYhnN6YQXR42nFhxASS1YLdyvu0oI4VuwSvRDJ6tavn3DpV90CtHXUvZE6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:49:38.862733Z"},"content_sha256":"698490ebc4f3f294e941af9229130aa679b32e454d54e32adbae600769b62c2f","schema_version":"1.0","event_id":"sha256:698490ebc4f3f294e941af9229130aa679b32e454d54e32adbae600769b62c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/bundle.json","state_url":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T15:49:38Z","links":{"resolver":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO","bundle":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/bundle.json","state":"https://pith.science/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSKUKNVTMYVOIMGGVY7SF54XZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XSKUKNVTMYVOIMGGVY7SF54XZO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"806b5f86106a85f28a4445b609b415fdbf7bc4767f5a0ed179770402bbcb2981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-22T21:08:39Z","title_canon_sha256":"f5a4c1acc9d2f4232ba1a83c5c0a48374122742b002dad80aed0810626fbb387"},"schema_version":"1.0","source":{"id":"1907.09575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09575","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09575v1","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09575","created_at":"2026-05-17T23:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"XSKUKNVTMYVO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XSKUKNVTMYVOIMGG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XSKUKNVT","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:698490ebc4f3f294e941af9229130aa679b32e454d54e32adbae600769b62c2f","target":"graph","created_at":"2026-05-17T23:39:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ancy Sarah Tom, George Karypis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-22T21:08:39Z","title":"A 2D Parallel Triangle Counting Algorithm for Distributed-Memory Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09575","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f333f922141b94434be1c99e9c2a63c1644052ace80ae63e8224d3e97c0021d","target":"record","created_at":"2026-05-17T23:39:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"806b5f86106a85f28a4445b609b415fdbf7bc4767f5a0ed179770402bbcb2981","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-22T21:08:39Z","title_canon_sha256":"f5a4c1acc9d2f4232ba1a83c5c0a48374122742b002dad80aed0810626fbb387"},"schema_version":"1.0","source":{"id":"1907.09575","kind":"arxiv","version":1}},"canonical_sha256":"bc954536b3662ae430c6ae3f22f797cbb5e9d7cdd813009f3fb9f313a3ef351c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc954536b3662ae430c6ae3f22f797cbb5e9d7cdd813009f3fb9f313a3ef351c","first_computed_at":"2026-05-17T23:39:52.873134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:52.873134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DODQJVLISFcSyfw3jsXiZh84zJh6yxxO9TLzT/EEOmoTqxGw2B+T5c+yFD4edkjrolFL0UgZZLHhnF0HE+b/BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:52.873630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f333f922141b94434be1c99e9c2a63c1644052ace80ae63e8224d3e97c0021d","sha256:698490ebc4f3f294e941af9229130aa679b32e454d54e32adbae600769b62c2f"],"state_sha256":"a35d37824dc8180d09852387a625de796db3e4224d354e2dfacbf84beb51c59a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJz6cMN3hd1BCHzejtQ+oKQI2y6y8VWVkYSfBvWr8yWjlpVRxfb0kTOtvpGwqgEFZPri4CsR32zitNS9Rw98CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:49:38.866537Z","bundle_sha256":"972c04e397caa2c1b4ae8b54bb446cb77943b3188765a6903f4eedb3575b3c76"}}