{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GAHPTGULJ5OWW36NJS27F4FTQS","short_pith_number":"pith:GAHPTGUL","canonical_record":{"source":{"id":"1805.06151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-16T06:32:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6e256fb01329346606b2d518e5e5be1f319097a45e3339086b3df47821184edc","abstract_canon_sha256":"0833c54639f28303ebb3ff9f6a4116e9f99b3984a3a6b539f5ea8db419c86755"},"schema_version":"1.0"},"canonical_sha256":"300ef99a8b4f5d6b6fcd4cb5f2f0b384915c4ceeec92adae3fb86811628aa3dc","source":{"kind":"arxiv","id":"1805.06151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06151","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06151v1","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06151","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"GAHPTGULJ5OW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GAHPTGULJ5OWW36N","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GAHPTGUL","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GAHPTGULJ5OWW36NJS27F4FTQS","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-16T06:32:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6e256fb01329346606b2d518e5e5be1f319097a45e3339086b3df47821184edc","abstract_canon_sha256":"0833c54639f28303ebb3ff9f6a4116e9f99b3984a3a6b539f5ea8db419c86755"},"schema_version":"1.0"},"canonical_sha256":"300ef99a8b4f5d6b6fcd4cb5f2f0b384915c4ceeec92adae3fb86811628aa3dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:48.694197Z","signature_b64":"FOhmylj0/3voCQTayPg+fUde85/e/I86NLFV83Ejq2Ncg2FfxClptN7wVVZozJ+NpCeL6JfzkhaLlAxMyxg9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"300ef99a8b4f5d6b6fcd4cb5f2f0b384915c4ceeec92adae3fb86811628aa3dc","last_reissued_at":"2026-05-18T00:15:48.693511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:48.693511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06151","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-05-18T00:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RHf5q+3voGMFG1aNw7NXOjdvaOnCvH5u0LHsc1tA6mQAsKfJjmeBfyj0u40l3iktBCEkmP0Im9iAny18CS6HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:40:14.384735Z"},"content_sha256":"91969228cb6cecfcb27fbaf18048a8e7c3991c79a4c47c50203c5a3ad9bdf63e","schema_version":"1.0","event_id":"sha256:91969228cb6cecfcb27fbaf18048a8e7c3991c79a4c47c50203c5a3ad9bdf63e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GAHPTGULJ5OWW36NJS27F4FTQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ely Porat, Tsvi Kopelowitz, Yair Rosenmutter","submitted_at":"2018-05-16T06:32:44Z","abstract_excerpt":"This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with $n$ vertices and $m$ edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using $O(\\sqrt n)$ processors and $O(\\log n)$ worst-case update time, for a total of $O(\\sqrt n \\log n)$ work. This improves on the work of Ferragina [IPPS 1995] which costs $O(\\log n)$ worst-case update time and $O(n^{2/3} \\log{\\frac{m}{n}})$ work."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06151","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":""},"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:15:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a60u6Gj8E9SK9x9eCZa+2i/40+rvrukaflhSmEfQMn0cIsQb/D3yANSO5UoJ3msJp8UaWvBgcvnA2iJj+EOXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:40:14.385528Z"},"content_sha256":"17a14a1fed95529b0f8d1927f4841d33c1b0d895357265fdc729d1836061e079","schema_version":"1.0","event_id":"sha256:17a14a1fed95529b0f8d1927f4841d33c1b0d895357265fdc729d1836061e079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAHPTGULJ5OWW36NJS27F4FTQS/bundle.json","state_url":"https://pith.science/pith/GAHPTGULJ5OWW36NJS27F4FTQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAHPTGULJ5OWW36NJS27F4FTQS/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-30T02:40:14Z","links":{"resolver":"https://pith.science/pith/GAHPTGULJ5OWW36NJS27F4FTQS","bundle":"https://pith.science/pith/GAHPTGULJ5OWW36NJS27F4FTQS/bundle.json","state":"https://pith.science/pith/GAHPTGULJ5OWW36NJS27F4FTQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAHPTGULJ5OWW36NJS27F4FTQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GAHPTGULJ5OWW36NJS27F4FTQS","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":"0833c54639f28303ebb3ff9f6a4116e9f99b3984a3a6b539f5ea8db419c86755","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-16T06:32:44Z","title_canon_sha256":"6e256fb01329346606b2d518e5e5be1f319097a45e3339086b3df47821184edc"},"schema_version":"1.0","source":{"id":"1805.06151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06151","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06151v1","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06151","created_at":"2026-05-18T00:15:48Z"},{"alias_kind":"pith_short_12","alias_value":"GAHPTGULJ5OW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GAHPTGULJ5OWW36N","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GAHPTGUL","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:17a14a1fed95529b0f8d1927f4841d33c1b0d895357265fdc729d1836061e079","target":"graph","created_at":"2026-05-18T00:15: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":"This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with $n$ vertices and $m$ edges while supporting edge insertions and deletions. We show that one can solve the dynamic MSF problem using $O(\\sqrt n)$ processors and $O(\\log n)$ worst-case update time, for a total of $O(\\sqrt n \\log n)$ work. This improves on the work of Ferragina [IPPS 1995] which costs $O(\\log n)$ worst-case update time and $O(n^{2/3} \\log{\\frac{m}{n}})$ work.","authors_text":"Ely Porat, Tsvi Kopelowitz, Yair Rosenmutter","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-16T06:32:44Z","title":"Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06151","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:91969228cb6cecfcb27fbaf18048a8e7c3991c79a4c47c50203c5a3ad9bdf63e","target":"record","created_at":"2026-05-18T00:15: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":"0833c54639f28303ebb3ff9f6a4116e9f99b3984a3a6b539f5ea8db419c86755","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-16T06:32:44Z","title_canon_sha256":"6e256fb01329346606b2d518e5e5be1f319097a45e3339086b3df47821184edc"},"schema_version":"1.0","source":{"id":"1805.06151","kind":"arxiv","version":1}},"canonical_sha256":"300ef99a8b4f5d6b6fcd4cb5f2f0b384915c4ceeec92adae3fb86811628aa3dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"300ef99a8b4f5d6b6fcd4cb5f2f0b384915c4ceeec92adae3fb86811628aa3dc","first_computed_at":"2026-05-18T00:15:48.693511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:48.693511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FOhmylj0/3voCQTayPg+fUde85/e/I86NLFV83Ejq2Ncg2FfxClptN7wVVZozJ+NpCeL6JfzkhaLlAxMyxg9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:48.694197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91969228cb6cecfcb27fbaf18048a8e7c3991c79a4c47c50203c5a3ad9bdf63e","sha256:17a14a1fed95529b0f8d1927f4841d33c1b0d895357265fdc729d1836061e079"],"state_sha256":"33e81611590117ed7a7e0fce7800c7d3ea57d9ee2f7114db4defab1ab07027f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odGTw+kmLVPsCVtsAK92g7dt52ZCZJXZeXCqOUxYzdfmQW/HE0jbIMzaUy7F8sbKSY0iey01AaMhK57LlOJsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:40:14.391071Z","bundle_sha256":"a080417b0eeec245416b42b67372feaaf461b1a36d9d568bd4986d2ee324fb96"}}