{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EHYMAUGDTPB2RU2V3XOUMQHS2Z","short_pith_number":"pith:EHYMAUGD","canonical_record":{"source":{"id":"1809.00896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-04T11:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"3b2be3ce1f4e53300b4c54eef95cdd586d2c76e7b06e3ebef5591bf11c3b751a","abstract_canon_sha256":"8726d13903aefb1cbcbc6bf82feff6b9226146133bc1431a8908294f78608447"},"schema_version":"1.0"},"canonical_sha256":"21f0c050c39bc3a8d355dddd4640f2d64c1f69a6b5beaece56c630502c6d5ebb","source":{"kind":"arxiv","id":"1809.00896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00896","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00896v2","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00896","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"EHYMAUGDTPB2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EHYMAUGDTPB2RU2V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EHYMAUGD","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EHYMAUGDTPB2RU2V3XOUMQHS2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-04T11:35:27Z","cross_cats_sorted":[],"title_canon_sha256":"3b2be3ce1f4e53300b4c54eef95cdd586d2c76e7b06e3ebef5591bf11c3b751a","abstract_canon_sha256":"8726d13903aefb1cbcbc6bf82feff6b9226146133bc1431a8908294f78608447"},"schema_version":"1.0"},"canonical_sha256":"21f0c050c39bc3a8d355dddd4640f2d64c1f69a6b5beaece56c630502c6d5ebb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:23.202476Z","signature_b64":"W6MnX09onQI2VEjX15R+z3WBUvTX02K+1SbD7AenrbIOlTBcbO+yXXNwUK2cgTMRUhpDJoXmSZtc9x5roRNfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f0c050c39bc3a8d355dddd4640f2d64c1f69a6b5beaece56c630502c6d5ebb","last_reissued_at":"2026-05-17T23:56:23.201777Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:23.201777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00896","source_version":2,"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:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"om+KH8QXU/lD0EsMEGtfASnqKgw78/KGuYXEoJqfbBQ+1nk72VO7/VNCy1N5Hr4ZJKctXV2wikuX24Em2jlsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:22:09.199484Z"},"content_sha256":"19739369838caa4b847fd85ee94f0bc554efc1e3c59f7b6c55167a0ce93aa504","schema_version":"1.0","event_id":"sha256:19739369838caa4b847fd85ee94f0bc554efc1e3c59f7b6c55167a0ce93aa504"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EHYMAUGDTPB2RU2V3XOUMQHS2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bapi Chatterjee, Muktikanta Sa, Nandini Singhal, Sathya Peri","submitted_at":"2018-09-04T11:35:27Z","abstract_excerpt":"Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- addition and removal of vertices and/or edges -- in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a conc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00896","kind":"arxiv","version":2},"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:56:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mu0YcsW9lpbK83uP38O08MOeApCRNIgVkqMaSwPjdvUuuwgyi8idMnckgvc58fwi5LKIA7uNVzKIvXO8B0t9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:22:09.200178Z"},"content_sha256":"2bab7b466f99bf3f746f59c755cc755b18fc2a544da2e7ebc769c5280c08779b","schema_version":"1.0","event_id":"sha256:2bab7b466f99bf3f746f59c755cc755b18fc2a544da2e7ebc769c5280c08779b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/bundle.json","state_url":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/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-25T12:22:09Z","links":{"resolver":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z","bundle":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/bundle.json","state":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EHYMAUGDTPB2RU2V3XOUMQHS2Z","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":"8726d13903aefb1cbcbc6bf82feff6b9226146133bc1431a8908294f78608447","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-04T11:35:27Z","title_canon_sha256":"3b2be3ce1f4e53300b4c54eef95cdd586d2c76e7b06e3ebef5591bf11c3b751a"},"schema_version":"1.0","source":{"id":"1809.00896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00896","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00896v2","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00896","created_at":"2026-05-17T23:56:23Z"},{"alias_kind":"pith_short_12","alias_value":"EHYMAUGDTPB2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EHYMAUGDTPB2RU2V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EHYMAUGD","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:2bab7b466f99bf3f746f59c755cc755b18fc2a544da2e7ebc769c5280c08779b","target":"graph","created_at":"2026-05-17T23:56:23Z","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":"Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- addition and removal of vertices and/or edges -- in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a conc","authors_text":"Bapi Chatterjee, Muktikanta Sa, Nandini Singhal, Sathya Peri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-04T11:35:27Z","title":"A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00896","kind":"arxiv","version":2},"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:19739369838caa4b847fd85ee94f0bc554efc1e3c59f7b6c55167a0ce93aa504","target":"record","created_at":"2026-05-17T23:56:23Z","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":"8726d13903aefb1cbcbc6bf82feff6b9226146133bc1431a8908294f78608447","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-04T11:35:27Z","title_canon_sha256":"3b2be3ce1f4e53300b4c54eef95cdd586d2c76e7b06e3ebef5591bf11c3b751a"},"schema_version":"1.0","source":{"id":"1809.00896","kind":"arxiv","version":2}},"canonical_sha256":"21f0c050c39bc3a8d355dddd4640f2d64c1f69a6b5beaece56c630502c6d5ebb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21f0c050c39bc3a8d355dddd4640f2d64c1f69a6b5beaece56c630502c6d5ebb","first_computed_at":"2026-05-17T23:56:23.201777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:23.201777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W6MnX09onQI2VEjX15R+z3WBUvTX02K+1SbD7AenrbIOlTBcbO+yXXNwUK2cgTMRUhpDJoXmSZtc9x5roRNfDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:23.202476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19739369838caa4b847fd85ee94f0bc554efc1e3c59f7b6c55167a0ce93aa504","sha256:2bab7b466f99bf3f746f59c755cc755b18fc2a544da2e7ebc769c5280c08779b"],"state_sha256":"b1d46be9e451852eaebe0b5a60e3642b0a220fa0fcf64cfabc5df4e7513fd1e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sb+6YaJ8jaSpLIxfa+Vb7Jt2WGowKU+fYWkKuUVoYKPd4BWCwO5K6DTAFnw9WFzwF80Z1qi6jMLkR/um3AgECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:22:09.203809Z","bundle_sha256":"1aef7b7f2f9ba72199920e2f4572e8e9068c480c3b0b0a9e8060f08d2832eb1d"}}