{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S6FSDB5HA3UEFZ5WAZ3EHZLFEX","short_pith_number":"pith:S6FSDB5H","canonical_record":{"source":{"id":"1512.04832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-15T16:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"90d90fdb1aac27bfdcc60514c0b3d0f6edb216a772401f977ccbdfb539c34b9f","abstract_canon_sha256":"d6147e6bfe28645ef5dd467f5da29603a9a7e9edd91c9b554f21e79df2a9c51a"},"schema_version":"1.0"},"canonical_sha256":"978b2187a706e842e7b6067643e56525e36e7ba226e735226053e6a9b04f3dcc","source":{"kind":"arxiv","id":"1512.04832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04832","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04832v1","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04832","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"S6FSDB5HA3UE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6FSDB5HA3UEFZ5W","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6FSDB5H","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S6FSDB5HA3UEFZ5WAZ3EHZLFEX","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-15T16:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"90d90fdb1aac27bfdcc60514c0b3d0f6edb216a772401f977ccbdfb539c34b9f","abstract_canon_sha256":"d6147e6bfe28645ef5dd467f5da29603a9a7e9edd91c9b554f21e79df2a9c51a"},"schema_version":"1.0"},"canonical_sha256":"978b2187a706e842e7b6067643e56525e36e7ba226e735226053e6a9b04f3dcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:15.328648Z","signature_b64":"8GGwfxRhQpIbaZSNWaO2grlBe8gUdZyM8MFl977TMbTRfYd9nGzYbPmxMUXxuXEpvmCV87fcmVCO6eWY8M3LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"978b2187a706e842e7b6067643e56525e36e7ba226e735226053e6a9b04f3dcc","last_reissued_at":"2026-05-18T01:24:15.327989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:15.327989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04832","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-18T01:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5AhKUY+Ev+CCGNnJz2v5DbSLADutnb055ekBitN+22hR13YPKJ2EP7M0WupfkJFa34/M4aSp2DcnmiyYJlcVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:19:37.275301Z"},"content_sha256":"55f24e8920eee201d48792d497ff4c6797d67500c6222d8c8394d45525be64b1","schema_version":"1.0","event_id":"sha256:55f24e8920eee201d48792d497ff4c6797d67500c6222d8c8394d45525be64b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S6FSDB5HA3UEFZ5WAZ3EHZLFEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman (GANG, David Peleg, LIAFA), Liah Kor","submitted_at":"2015-12-15T16:01:53Z","abstract_excerpt":"This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously O(m) messages and O($\\sqrt$ n+D) time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G's diameter. On the other hand, we show that any MST verification algorithm must send {\\Omega}(m) messages and incur {\\Omega}($\\sq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04832","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-18T01:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbZqq5c8QAXJaSd9Y81GAvNnvDp/xjlVA4zMIUP7t3V+DriI1rttj+0Pw8WZzAGpZoUr9Dgnr+U5Sglm6UdiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:19:37.276010Z"},"content_sha256":"e13659e9bf60de69fee6905f59b2b8835b6fd0ff0c7622e6b446253f460baa30","schema_version":"1.0","event_id":"sha256:e13659e9bf60de69fee6905f59b2b8835b6fd0ff0c7622e6b446253f460baa30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX/bundle.json","state_url":"https://pith.science/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX/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-26T20:19:37Z","links":{"resolver":"https://pith.science/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX","bundle":"https://pith.science/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX/bundle.json","state":"https://pith.science/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6FSDB5HA3UEFZ5WAZ3EHZLFEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S6FSDB5HA3UEFZ5WAZ3EHZLFEX","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":"d6147e6bfe28645ef5dd467f5da29603a9a7e9edd91c9b554f21e79df2a9c51a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-15T16:01:53Z","title_canon_sha256":"90d90fdb1aac27bfdcc60514c0b3d0f6edb216a772401f977ccbdfb539c34b9f"},"schema_version":"1.0","source":{"id":"1512.04832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04832","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04832v1","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04832","created_at":"2026-05-18T01:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"S6FSDB5HA3UE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S6FSDB5HA3UEFZ5W","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S6FSDB5H","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:e13659e9bf60de69fee6905f59b2b8835b6fd0ff0c7622e6b446253f460baa30","target":"graph","created_at":"2026-05-18T01:24:15Z","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 introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously O(m) messages and O($\\sqrt$ n+D) time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G's diameter. On the other hand, we show that any MST verification algorithm must send {\\Omega}(m) messages and incur {\\Omega}($\\sq","authors_text":"Amos Korman (GANG, David Peleg, LIAFA), Liah Kor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-15T16:01:53Z","title":"Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04832","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:55f24e8920eee201d48792d497ff4c6797d67500c6222d8c8394d45525be64b1","target":"record","created_at":"2026-05-18T01:24:15Z","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":"d6147e6bfe28645ef5dd467f5da29603a9a7e9edd91c9b554f21e79df2a9c51a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-12-15T16:01:53Z","title_canon_sha256":"90d90fdb1aac27bfdcc60514c0b3d0f6edb216a772401f977ccbdfb539c34b9f"},"schema_version":"1.0","source":{"id":"1512.04832","kind":"arxiv","version":1}},"canonical_sha256":"978b2187a706e842e7b6067643e56525e36e7ba226e735226053e6a9b04f3dcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"978b2187a706e842e7b6067643e56525e36e7ba226e735226053e6a9b04f3dcc","first_computed_at":"2026-05-18T01:24:15.327989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:15.327989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8GGwfxRhQpIbaZSNWaO2grlBe8gUdZyM8MFl977TMbTRfYd9nGzYbPmxMUXxuXEpvmCV87fcmVCO6eWY8M3LBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:15.328648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55f24e8920eee201d48792d497ff4c6797d67500c6222d8c8394d45525be64b1","sha256:e13659e9bf60de69fee6905f59b2b8835b6fd0ff0c7622e6b446253f460baa30"],"state_sha256":"224605546f5d252e0266f2dcb2f057fb1a1ca2c2de9d4e07b40a02138f4c2f7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5Bvz4IEYXTBYIGYvKjUso0fIYW5O9JwjTbW7pAtwvd3SGv7cRKroyvGhi5gc36WKHHu7FcomKC9Je5lrcIXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:19:37.279697Z","bundle_sha256":"aa81af38d406e561595ae9595686e83c3dc8d4ddb2eb3bf4089fcf819a50dd31"}}