{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7NSSTEHR7ZPF63GODVWBBYXS3V","short_pith_number":"pith:7NSSTEHR","canonical_record":{"source":{"id":"2607.20211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-22T14:31:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a1e3290f5f6752e0eff3f499fe2c2e6bc93707cb8c7b1a858753fd5e624610cd","abstract_canon_sha256":"ac4b2ca278763317f646042cef78cd8a7b38b32beddf1ee931bdb2c18a47bfa5"},"schema_version":"1.0"},"canonical_sha256":"fb652990f1fe5e5f6cce1d6c10e2f2dd68063c9aded83a81e494e7ccb0fa8008","source":{"kind":"arxiv","id":"2607.20211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20211","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20211v1","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20211","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"pith_short_12","alias_value":"7NSSTEHR7ZPF","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"pith_short_16","alias_value":"7NSSTEHR7ZPF63GO","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"pith_short_8","alias_value":"7NSSTEHR","created_at":"2026-07-23T01:25:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7NSSTEHR7ZPF63GODVWBBYXS3V","target":"record","payload":{"canonical_record":{"source":{"id":"2607.20211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-22T14:31:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a1e3290f5f6752e0eff3f499fe2c2e6bc93707cb8c7b1a858753fd5e624610cd","abstract_canon_sha256":"ac4b2ca278763317f646042cef78cd8a7b38b32beddf1ee931bdb2c18a47bfa5"},"schema_version":"1.0"},"canonical_sha256":"fb652990f1fe5e5f6cce1d6c10e2f2dd68063c9aded83a81e494e7ccb0fa8008","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:25:07.965680Z","signature_b64":"Twx3zFdiOqSCIO+BN+ZmIqB44ecUFIyRWOkaCwbjh7yo8Roxu8/1E9T8HbJ+dkJoFlOZc6xA1KyWS57tjH04DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb652990f1fe5e5f6cce1d6c10e2f2dd68063c9aded83a81e494e7ccb0fa8008","last_reissued_at":"2026-07-23T01:25:07.964785Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:25:07.964785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.20211","source_version":1,"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-07-23T01:25:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8o6QXsekI3yHYST7RMhMlnGrMOqtM6DDFQLXQ1w5IY/QJSpejF4FF9nAzlZt5JPKvPY9F2tt+Ve92EowjtI+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T02:01:47.929757Z"},"content_sha256":"dbbe664698ea70b88dfeb6ce4668b30c331fd6cb4ec71dab879cb920c2724c5e","schema_version":"1.0","event_id":"sha256:dbbe664698ea70b88dfeb6ce4668b30c331fd6cb4ec71dab879cb920c2724c5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7NSSTEHR7ZPF63GODVWBBYXS3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Rooted Spanning Tree on GPU","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Abhijeet Sahu, G. Ramakrishna, Harmit Singh, Soham Nandy","submitted_at":"2026-07-22T14:31:03Z","abstract_excerpt":"Spanning trees are fundamental structures in graph theory, essential for various applications such as network maintenance, routing adjustments, and many more. The dynamic nature of real-world networks requires efficient updates to these structures as the underlying graph evolves. Maintaining rooted spanning trees dynamically is particularly crucial for algorithms addressing 2-connected components and minimum-weighted spanning trees. In this paper, we address the challenge of maintaining a rooted spanning forest when a batch of edges are inserted or deleted. We present four novel fully dynamic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20211","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.20211/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-23T01:25:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utY2tS/8QJHLuB7hE2ww9dO2pxw0e6B5PNdzmGGmK3L73UzN3hvO53S1ggiJ6xIixBi0yvegx5t2TjnzsBicCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T02:01:47.930393Z"},"content_sha256":"e5a00c9d97f5b4d7843df8998395eddc62c8ddeb125859af14cc3abb9dacdd4f","schema_version":"1.0","event_id":"sha256:e5a00c9d97f5b4d7843df8998395eddc62c8ddeb125859af14cc3abb9dacdd4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7NSSTEHR7ZPF63GODVWBBYXS3V/bundle.json","state_url":"https://pith.science/pith/7NSSTEHR7ZPF63GODVWBBYXS3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7NSSTEHR7ZPF63GODVWBBYXS3V/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-08-21T02:01:47Z","links":{"resolver":"https://pith.science/pith/7NSSTEHR7ZPF63GODVWBBYXS3V","bundle":"https://pith.science/pith/7NSSTEHR7ZPF63GODVWBBYXS3V/bundle.json","state":"https://pith.science/pith/7NSSTEHR7ZPF63GODVWBBYXS3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7NSSTEHR7ZPF63GODVWBBYXS3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7NSSTEHR7ZPF63GODVWBBYXS3V","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":"ac4b2ca278763317f646042cef78cd8a7b38b32beddf1ee931bdb2c18a47bfa5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-22T14:31:03Z","title_canon_sha256":"a1e3290f5f6752e0eff3f499fe2c2e6bc93707cb8c7b1a858753fd5e624610cd"},"schema_version":"1.0","source":{"id":"2607.20211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.20211","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"arxiv_version","alias_value":"2607.20211v1","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20211","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"pith_short_12","alias_value":"7NSSTEHR7ZPF","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"pith_short_16","alias_value":"7NSSTEHR7ZPF63GO","created_at":"2026-07-23T01:25:07Z"},{"alias_kind":"pith_short_8","alias_value":"7NSSTEHR","created_at":"2026-07-23T01:25:07Z"}],"graph_snapshots":[{"event_id":"sha256:e5a00c9d97f5b4d7843df8998395eddc62c8ddeb125859af14cc3abb9dacdd4f","target":"graph","created_at":"2026-07-23T01:25:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.20211/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Spanning trees are fundamental structures in graph theory, essential for various applications such as network maintenance, routing adjustments, and many more. The dynamic nature of real-world networks requires efficient updates to these structures as the underlying graph evolves. Maintaining rooted spanning trees dynamically is particularly crucial for algorithms addressing 2-connected components and minimum-weighted spanning trees. In this paper, we address the challenge of maintaining a rooted spanning forest when a batch of edges are inserted or deleted. We present four novel fully dynamic ","authors_text":"Abhijeet Sahu, G. Ramakrishna, Harmit Singh, Soham Nandy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-22T14:31:03Z","title":"Fully Dynamic Rooted Spanning Tree on GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20211","kind":"arxiv","version":1},"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:dbbe664698ea70b88dfeb6ce4668b30c331fd6cb4ec71dab879cb920c2724c5e","target":"record","created_at":"2026-07-23T01:25:07Z","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":"ac4b2ca278763317f646042cef78cd8a7b38b32beddf1ee931bdb2c18a47bfa5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-07-22T14:31:03Z","title_canon_sha256":"a1e3290f5f6752e0eff3f499fe2c2e6bc93707cb8c7b1a858753fd5e624610cd"},"schema_version":"1.0","source":{"id":"2607.20211","kind":"arxiv","version":1}},"canonical_sha256":"fb652990f1fe5e5f6cce1d6c10e2f2dd68063c9aded83a81e494e7ccb0fa8008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb652990f1fe5e5f6cce1d6c10e2f2dd68063c9aded83a81e494e7ccb0fa8008","first_computed_at":"2026-07-23T01:25:07.964785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:25:07.964785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Twx3zFdiOqSCIO+BN+ZmIqB44ecUFIyRWOkaCwbjh7yo8Roxu8/1E9T8HbJ+dkJoFlOZc6xA1KyWS57tjH04DA==","signature_status":"signed_v1","signed_at":"2026-07-23T01:25:07.965680Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.20211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbbe664698ea70b88dfeb6ce4668b30c331fd6cb4ec71dab879cb920c2724c5e","sha256:e5a00c9d97f5b4d7843df8998395eddc62c8ddeb125859af14cc3abb9dacdd4f"],"state_sha256":"252c218e3ec0f4f157fa42b980135a9e4901c98bba9c21e3bfdea51be2f2119c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWW0orBSSjc+XzluEf9zAdTdg3ue/Vn0zRFSDQQV3MRA5Zs1sQIcmI2Ua6vTrch3fazSxDcdVOpFTg9NtT9uCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T02:01:47.934108Z","bundle_sha256":"47599e7235f885d0e0f406f2eef1f4e509a6c9f63ca3204d90ea4f53c129e723"}}