{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MTIDKUE7VZVOMR6BMG2IKBW6TB","short_pith_number":"pith:MTIDKUE7","canonical_record":{"source":{"id":"1804.01276","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T07:41:48Z","cross_cats_sorted":[],"title_canon_sha256":"5bbbd293575d6e02eedb0a8a986f69414595c700779fb1a3eb0a2b9a80518556","abstract_canon_sha256":"048599a9f3ae76ab428937aa298064d09fa44d0573157d0d7d0643d0974a94c7"},"schema_version":"1.0"},"canonical_sha256":"64d035509fae6ae647c161b48506de98660e324c36440dc88446cb40bd896340","source":{"kind":"arxiv","id":"1804.01276","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01276","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01276v3","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01276","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"MTIDKUE7VZVO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTIDKUE7VZVOMR6B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTIDKUE7","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MTIDKUE7VZVOMR6BMG2IKBW6TB","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01276","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T07:41:48Z","cross_cats_sorted":[],"title_canon_sha256":"5bbbd293575d6e02eedb0a8a986f69414595c700779fb1a3eb0a2b9a80518556","abstract_canon_sha256":"048599a9f3ae76ab428937aa298064d09fa44d0573157d0d7d0643d0974a94c7"},"schema_version":"1.0"},"canonical_sha256":"64d035509fae6ae647c161b48506de98660e324c36440dc88446cb40bd896340","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:48.653099Z","signature_b64":"bDNsAbWb+8pDEPwyPr8D8BLQs0N62kldq5P8hgLRawloLUDuEg3SyJKzdOTDN9G3g5hyYNDYmaB6S74cnRa+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d035509fae6ae647c161b48506de98660e324c36440dc88446cb40bd896340","last_reissued_at":"2026-05-18T00:18:48.652442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:48.652442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01276","source_version":3,"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-18T00:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6e3SnJ2G6J0oGrkHoAIkjL7hnU4YUgjzes73oJnd6H4h1VIETvN4p5YCYm09LAd5sGNdDGRHgF78iAd7p3wDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:40:28.529895Z"},"content_sha256":"6ad743e66c6f454203b72f6b41ca4d76ad567334f04761e7559a16195b1551fc","schema_version":"1.0","event_id":"sha256:6ad743e66c6f454203b72f6b41ca4d76ad567334f04761e7559a16195b1551fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MTIDKUE7VZVOMR6BMG2IKBW6TB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maintenance of Strongly Connected Component in Shared-memory Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Muktikanta Sa","submitted_at":"2018-04-04T07:41:48Z","abstract_excerpt":"In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads. To the best of our knowledge, this is the first work to propose using linearizable concurrent directed graph and is build using both ordered and unordered list-based set. We provide an empirical comparison against sequential and coarse-grained. The results show our algorithm's throughput is increased between 3 to 6x depending on different workload distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01276","kind":"arxiv","version":3},"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-18T00:18:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNf5XjuhH1ulAKuYZZg2dw869gYc6UmQ0f936ixVV1Q2MZzgFX6ee8y7HsN9126/4EYKdeX33Xa6SW3q806PAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:40:28.530229Z"},"content_sha256":"2a5dc3e16cbfcf8a2d1c7c5f9d6bcc469cd7ff00597780646fee92bef37357c5","schema_version":"1.0","event_id":"sha256:2a5dc3e16cbfcf8a2d1c7c5f9d6bcc469cd7ff00597780646fee92bef37357c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB/bundle.json","state_url":"https://pith.science/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB/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-06-28T22:40:28Z","links":{"resolver":"https://pith.science/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB","bundle":"https://pith.science/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB/bundle.json","state":"https://pith.science/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTIDKUE7VZVOMR6BMG2IKBW6TB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MTIDKUE7VZVOMR6BMG2IKBW6TB","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":"048599a9f3ae76ab428937aa298064d09fa44d0573157d0d7d0643d0974a94c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T07:41:48Z","title_canon_sha256":"5bbbd293575d6e02eedb0a8a986f69414595c700779fb1a3eb0a2b9a80518556"},"schema_version":"1.0","source":{"id":"1804.01276","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01276","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01276v3","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01276","created_at":"2026-05-18T00:18:48Z"},{"alias_kind":"pith_short_12","alias_value":"MTIDKUE7VZVO","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MTIDKUE7VZVOMR6B","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MTIDKUE7","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2a5dc3e16cbfcf8a2d1c7c5f9d6bcc469cd7ff00597780646fee92bef37357c5","target":"graph","created_at":"2026-05-18T00:18:48Z","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 present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads. To the best of our knowledge, this is the first work to propose using linearizable concurrent directed graph and is build using both ordered and unordered list-based set. We provide an empirical comparison against sequential and coarse-grained. The results show our algorithm's throughput is increased between 3 to 6x depending on different workload distri","authors_text":"Muktikanta Sa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T07:41:48Z","title":"Maintenance of Strongly Connected Component in Shared-memory Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01276","kind":"arxiv","version":3},"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:6ad743e66c6f454203b72f6b41ca4d76ad567334f04761e7559a16195b1551fc","target":"record","created_at":"2026-05-18T00:18:48Z","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":"048599a9f3ae76ab428937aa298064d09fa44d0573157d0d7d0643d0974a94c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-04T07:41:48Z","title_canon_sha256":"5bbbd293575d6e02eedb0a8a986f69414595c700779fb1a3eb0a2b9a80518556"},"schema_version":"1.0","source":{"id":"1804.01276","kind":"arxiv","version":3}},"canonical_sha256":"64d035509fae6ae647c161b48506de98660e324c36440dc88446cb40bd896340","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64d035509fae6ae647c161b48506de98660e324c36440dc88446cb40bd896340","first_computed_at":"2026-05-18T00:18:48.652442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:48.652442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bDNsAbWb+8pDEPwyPr8D8BLQs0N62kldq5P8hgLRawloLUDuEg3SyJKzdOTDN9G3g5hyYNDYmaB6S74cnRa+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:48.653099Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01276","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ad743e66c6f454203b72f6b41ca4d76ad567334f04761e7559a16195b1551fc","sha256:2a5dc3e16cbfcf8a2d1c7c5f9d6bcc469cd7ff00597780646fee92bef37357c5"],"state_sha256":"74a7f435a90795ca3c93730f21c4fa15c39056b4b383861cb1ac41d6eaae412c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ploZc68fjtqM4Tqaii0kbxdt2qIAjAKrG/YGtlrNsDTGZFrvzawU2wzCjN5TjA/kGzjyQPdp8X8Rv80ywXdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T22:40:28.532016Z","bundle_sha256":"1633b48ba58e1530c87366dfd4fe43e8755b974dab14c7d31952a39f535d054a"}}