{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HHUH6BHHAWR4AP54QAQ4CA5ZDX","short_pith_number":"pith:HHUH6BHH","schema_version":"1.0","canonical_sha256":"39e87f04e705a3c03fbc8021c103b91dce64f9d88a67eab0501aec78dab2bd45","source":{"kind":"arxiv","id":"1810.13325","version":2},"attestation_state":"computed","paper":{"title":"A Concurrent Unbounded Wait-Free Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chandra Kiran Reddy, Muktikanta Sa, Sathya Peri","submitted_at":"2018-10-31T15:08:18Z","abstract_excerpt":"In this paper, we propose an efficient concurrent wait-free algorithm to construct an unbounded directed graph for shared memory architecture. To the best of our knowledge that this is the first wait-free algorithm for an unbounded directed graph where insertion and deletion of vertices and/or edges can happen concurrently. To achieve wait-freedom in a dynamic setting, threads help each other to perform the desired tasks using operator descriptors by other threads. To enhance performance, we also developed an optimized wait-free graph based on the principle of fast-path-slow-path. We also prov"},"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":"1810.13325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-31T15:08:18Z","cross_cats_sorted":[],"title_canon_sha256":"fad5113d8ce55727c085defe93b5703d92636da7e3f6b777eedbe5067dc1a1b8","abstract_canon_sha256":"39e1df285e4aaedd3eafcec1176faccfe5423aa67dcc09fbac0934536de2afb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:31.972687Z","signature_b64":"eBU5htt+hR4WAEbA5Kb7JnoyAvUz7uBRxZ2EuX0KCDYiS9Y/K1XTr1i72GWpoU5lJDYpxTvGjciji+nsB+kvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39e87f04e705a3c03fbc8021c103b91dce64f9d88a67eab0501aec78dab2bd45","last_reissued_at":"2026-05-17T23:46:31.971970Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:31.971970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Concurrent Unbounded Wait-Free Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chandra Kiran Reddy, Muktikanta Sa, Sathya Peri","submitted_at":"2018-10-31T15:08:18Z","abstract_excerpt":"In this paper, we propose an efficient concurrent wait-free algorithm to construct an unbounded directed graph for shared memory architecture. To the best of our knowledge that this is the first wait-free algorithm for an unbounded directed graph where insertion and deletion of vertices and/or edges can happen concurrently. To achieve wait-freedom in a dynamic setting, threads help each other to perform the desired tasks using operator descriptors by other threads. To enhance performance, we also developed an optimized wait-free graph based on the principle of fast-path-slow-path. We also prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13325","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":"1810.13325","created_at":"2026-05-17T23:46:31.972063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13325v2","created_at":"2026-05-17T23:46:31.972063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13325","created_at":"2026-05-17T23:46:31.972063+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHUH6BHHAWR4","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHUH6BHHAWR4AP54","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHUH6BHH","created_at":"2026-05-18T12:32:28.185984+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/HHUH6BHHAWR4AP54QAQ4CA5ZDX","json":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX.json","graph_json":"https://pith.science/api/pith-number/HHUH6BHHAWR4AP54QAQ4CA5ZDX/graph.json","events_json":"https://pith.science/api/pith-number/HHUH6BHHAWR4AP54QAQ4CA5ZDX/events.json","paper":"https://pith.science/paper/HHUH6BHH"},"agent_actions":{"view_html":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX","download_json":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX.json","view_paper":"https://pith.science/paper/HHUH6BHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13325&json=true","fetch_graph":"https://pith.science/api/pith-number/HHUH6BHHAWR4AP54QAQ4CA5ZDX/graph.json","fetch_events":"https://pith.science/api/pith-number/HHUH6BHHAWR4AP54QAQ4CA5ZDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/action/storage_attestation","attest_author":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/action/author_attestation","sign_citation":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/action/citation_signature","submit_replication":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/action/replication_record"}},"created_at":"2026-05-17T23:46:31.972063+00:00","updated_at":"2026-05-17T23:46:31.972063+00:00"}