{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EHYMAUGDTPB2RU2V3XOUMQHS2Z","short_pith_number":"pith:EHYMAUGD","schema_version":"1.0","canonical_sha256":"21f0c050c39bc3a8d355dddd4640f2d64c1f69a6b5beaece56c630502c6d5ebb","source":{"kind":"arxiv","id":"1809.00896","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.00896","created_at":"2026-05-17T23:56:23.201856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00896v2","created_at":"2026-05-17T23:56:23.201856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00896","created_at":"2026-05-17T23:56:23.201856+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHYMAUGDTPB2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHYMAUGDTPB2RU2V","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHYMAUGD","created_at":"2026-05-18T12:32:22.470017+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/EHYMAUGDTPB2RU2V3XOUMQHS2Z","json":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z.json","graph_json":"https://pith.science/api/pith-number/EHYMAUGDTPB2RU2V3XOUMQHS2Z/graph.json","events_json":"https://pith.science/api/pith-number/EHYMAUGDTPB2RU2V3XOUMQHS2Z/events.json","paper":"https://pith.science/paper/EHYMAUGD"},"agent_actions":{"view_html":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z","download_json":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z.json","view_paper":"https://pith.science/paper/EHYMAUGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00896&json=true","fetch_graph":"https://pith.science/api/pith-number/EHYMAUGDTPB2RU2V3XOUMQHS2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EHYMAUGDTPB2RU2V3XOUMQHS2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/action/storage_attestation","attest_author":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/action/author_attestation","sign_citation":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/action/citation_signature","submit_replication":"https://pith.science/pith/EHYMAUGDTPB2RU2V3XOUMQHS2Z/action/replication_record"}},"created_at":"2026-05-17T23:56:23.201856+00:00","updated_at":"2026-05-17T23:56:23.201856+00:00"}