{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HHUH6BHHAWR4AP54QAQ4CA5ZDX","short_pith_number":"pith:HHUH6BHH","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"},"canonical_sha256":"39e87f04e705a3c03fbc8021c103b91dce64f9d88a67eab0501aec78dab2bd45","source":{"kind":"arxiv","id":"1810.13325","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13325","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13325v2","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13325","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"HHUH6BHHAWR4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHUH6BHHAWR4AP54","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHUH6BHH","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HHUH6BHHAWR4AP54QAQ4CA5ZDX","target":"record","payload":{"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"},"canonical_sha256":"39e87f04e705a3c03fbc8021c103b91dce64f9d88a67eab0501aec78dab2bd45","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"},"source_kind":"arxiv","source_id":"1810.13325","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:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZumbxzF0GXVYdOpk703Jr1V11MwDcLUq++LNoiEEFp4537vyejVphVQUCFXHcnyyDdvRWX/sYj8MgBWSaegCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:28:12.475748Z"},"content_sha256":"e93ef2e6466fc529b0735d7e2e8f9e1c45388902d234859ff7eea41f622eb95d","schema_version":"1.0","event_id":"sha256:e93ef2e6466fc529b0735d7e2e8f9e1c45388902d234859ff7eea41f622eb95d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HHUH6BHHAWR4AP54QAQ4CA5ZDX","target":"graph","payload":{"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"},"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:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35IFo+7vigYtQOCx+LVWiUyvgYke0meXj3MVz91paTj/jcDl24oDHX1lHiaoC95qKUkEgCdPG9F2yMGJqwr/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:28:12.476432Z"},"content_sha256":"b3bd9ec313757335fda2e5b1f0ea27fce4e3fea37e19d836318eba22b1e6a983","schema_version":"1.0","event_id":"sha256:b3bd9ec313757335fda2e5b1f0ea27fce4e3fea37e19d836318eba22b1e6a983"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/bundle.json","state_url":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/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-25T22:28:12Z","links":{"resolver":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX","bundle":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/bundle.json","state":"https://pith.science/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHUH6BHHAWR4AP54QAQ4CA5ZDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HHUH6BHHAWR4AP54QAQ4CA5ZDX","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":"39e1df285e4aaedd3eafcec1176faccfe5423aa67dcc09fbac0934536de2afb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-31T15:08:18Z","title_canon_sha256":"fad5113d8ce55727c085defe93b5703d92636da7e3f6b777eedbe5067dc1a1b8"},"schema_version":"1.0","source":{"id":"1810.13325","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13325","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13325v2","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13325","created_at":"2026-05-17T23:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"HHUH6BHHAWR4","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHUH6BHHAWR4AP54","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHUH6BHH","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:b3bd9ec313757335fda2e5b1f0ea27fce4e3fea37e19d836318eba22b1e6a983","target":"graph","created_at":"2026-05-17T23:46:31Z","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":"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","authors_text":"Chandra Kiran Reddy, Muktikanta Sa, Sathya Peri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-31T15:08:18Z","title":"A Concurrent Unbounded Wait-Free Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13325","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:e93ef2e6466fc529b0735d7e2e8f9e1c45388902d234859ff7eea41f622eb95d","target":"record","created_at":"2026-05-17T23:46:31Z","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":"39e1df285e4aaedd3eafcec1176faccfe5423aa67dcc09fbac0934536de2afb2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-31T15:08:18Z","title_canon_sha256":"fad5113d8ce55727c085defe93b5703d92636da7e3f6b777eedbe5067dc1a1b8"},"schema_version":"1.0","source":{"id":"1810.13325","kind":"arxiv","version":2}},"canonical_sha256":"39e87f04e705a3c03fbc8021c103b91dce64f9d88a67eab0501aec78dab2bd45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39e87f04e705a3c03fbc8021c103b91dce64f9d88a67eab0501aec78dab2bd45","first_computed_at":"2026-05-17T23:46:31.971970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:31.971970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eBU5htt+hR4WAEbA5Kb7JnoyAvUz7uBRxZ2EuX0KCDYiS9Y/K1XTr1i72GWpoU5lJDYpxTvGjciji+nsB+kvAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:31.972687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13325","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e93ef2e6466fc529b0735d7e2e8f9e1c45388902d234859ff7eea41f622eb95d","sha256:b3bd9ec313757335fda2e5b1f0ea27fce4e3fea37e19d836318eba22b1e6a983"],"state_sha256":"9b564b409d1f77e55e423548595fe58c89b3eba5b3447d6868605378d8e62c5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNoWPKKVOBtDCcGBoMFT6kgn1E9O4TCp6RK0+dPH3CQwKqdzAvDoUWFfgJMapIhla+wioDBoBV8Jvhuqj/zqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:28:12.480075Z","bundle_sha256":"72259ffa51223c2e31a55481261fb6ed8f1a4c68e8313ba13705f2833f38f4cc"}}