{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HNMYH6KLOEQYSBYTEFACEVBRZF","short_pith_number":"pith:HNMYH6KL","canonical_record":{"source":{"id":"1810.03513","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-08T14:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"b1814e56d3adee78cc69ce2d594ddae7c99d1495d3b4f456fc823140015d54e7","abstract_canon_sha256":"1deb8beb0369ebd5bb56eb0a3a09b1463e89b3847220432e0b86813f777eb0f8"},"schema_version":"1.0"},"canonical_sha256":"3b5983f94b71218907132140225431c94f282c6bb6f3f98864e2a0155cd94cf6","source":{"kind":"arxiv","id":"1810.03513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03513","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03513v1","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03513","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"HNMYH6KLOEQY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HNMYH6KLOEQYSBYT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HNMYH6KL","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HNMYH6KLOEQYSBYTEFACEVBRZF","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03513","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-08T14:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"b1814e56d3adee78cc69ce2d594ddae7c99d1495d3b4f456fc823140015d54e7","abstract_canon_sha256":"1deb8beb0369ebd5bb56eb0a3a09b1463e89b3847220432e0b86813f777eb0f8"},"schema_version":"1.0"},"canonical_sha256":"3b5983f94b71218907132140225431c94f282c6bb6f3f98864e2a0155cd94cf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:51.051005Z","signature_b64":"928nuWplLnPtGRG8HNoKTfPewdq7HoS8Y8NxKt+wQAJ0tG1k6FZAjteKFwec6Z+EuoPZRwvBlg21YOm9GyCUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b5983f94b71218907132140225431c94f282c6bb6f3f98864e2a0155cd94cf6","last_reissued_at":"2026-05-18T00:03:51.050283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:51.050283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03513","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:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"intLsWcWtbLv0J9Q1mX2pPnxKjXBcPgQp3BNWTZU568Vn0MCCl6ZdeV2HvbczAUE4U+LXgv8GYHVQvoiii4PDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:32:03.071651Z"},"content_sha256":"c2b342e94ca748678ef5724a9b44d18bbbf6a1b2b2faac4742f995d3159ee7ae","schema_version":"1.0","event_id":"sha256:c2b342e94ca748678ef5724a9b44d18bbbf6a1b2b2faac4742f995d3159ee7ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HNMYH6KLOEQYSBYTEFACEVBRZF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time-Message Trade-Offs in Distributed Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gopal Pandurangan, Robert Gmyr","submitted_at":"2018-10-08T14:59:22Z","abstract_excerpt":"This paper focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut, and many graph verification problems. We consider the synchronous CONGEST distributed computing model and assume that each node has initial knowledge of itself and the identifiers of its neighbors - the so-called KT1 model - a well-studied model that also naturally arises in many applications. Recently, it has been established that one can obtain (almost) singularly optimal algorithms, i.e., al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03513","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:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxHeLwyZkqm6y3I2DuOLV+R5h7RrPKJ7hacZ+9k+F7dRo/BOg+LmiKTzbeKkTDuCBY7jdeVJWg+ixL3JP/TkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:32:03.072097Z"},"content_sha256":"8dd497310ed297d257185f521c7b5beeab28105b63d6306530315ad5aba294d0","schema_version":"1.0","event_id":"sha256:8dd497310ed297d257185f521c7b5beeab28105b63d6306530315ad5aba294d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNMYH6KLOEQYSBYTEFACEVBRZF/bundle.json","state_url":"https://pith.science/pith/HNMYH6KLOEQYSBYTEFACEVBRZF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNMYH6KLOEQYSBYTEFACEVBRZF/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-30T00:32:03Z","links":{"resolver":"https://pith.science/pith/HNMYH6KLOEQYSBYTEFACEVBRZF","bundle":"https://pith.science/pith/HNMYH6KLOEQYSBYTEFACEVBRZF/bundle.json","state":"https://pith.science/pith/HNMYH6KLOEQYSBYTEFACEVBRZF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNMYH6KLOEQYSBYTEFACEVBRZF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HNMYH6KLOEQYSBYTEFACEVBRZF","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":"1deb8beb0369ebd5bb56eb0a3a09b1463e89b3847220432e0b86813f777eb0f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-08T14:59:22Z","title_canon_sha256":"b1814e56d3adee78cc69ce2d594ddae7c99d1495d3b4f456fc823140015d54e7"},"schema_version":"1.0","source":{"id":"1810.03513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03513","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03513v1","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03513","created_at":"2026-05-18T00:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"HNMYH6KLOEQY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HNMYH6KLOEQYSBYT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HNMYH6KL","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:8dd497310ed297d257185f521c7b5beeab28105b63d6306530315ad5aba294d0","target":"graph","created_at":"2026-05-18T00:03:51Z","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 focuses on showing time-message trade-offs in distributed algorithms for fundamental problems such as leader election, broadcast, spanning tree (ST), minimum spanning tree (MST), minimum cut, and many graph verification problems. We consider the synchronous CONGEST distributed computing model and assume that each node has initial knowledge of itself and the identifiers of its neighbors - the so-called KT1 model - a well-studied model that also naturally arises in many applications. Recently, it has been established that one can obtain (almost) singularly optimal algorithms, i.e., al","authors_text":"Gopal Pandurangan, Robert Gmyr","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-08T14:59:22Z","title":"Time-Message Trade-Offs in Distributed Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03513","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:c2b342e94ca748678ef5724a9b44d18bbbf6a1b2b2faac4742f995d3159ee7ae","target":"record","created_at":"2026-05-18T00:03:51Z","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":"1deb8beb0369ebd5bb56eb0a3a09b1463e89b3847220432e0b86813f777eb0f8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-10-08T14:59:22Z","title_canon_sha256":"b1814e56d3adee78cc69ce2d594ddae7c99d1495d3b4f456fc823140015d54e7"},"schema_version":"1.0","source":{"id":"1810.03513","kind":"arxiv","version":1}},"canonical_sha256":"3b5983f94b71218907132140225431c94f282c6bb6f3f98864e2a0155cd94cf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b5983f94b71218907132140225431c94f282c6bb6f3f98864e2a0155cd94cf6","first_computed_at":"2026-05-18T00:03:51.050283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:51.050283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"928nuWplLnPtGRG8HNoKTfPewdq7HoS8Y8NxKt+wQAJ0tG1k6FZAjteKFwec6Z+EuoPZRwvBlg21YOm9GyCUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:51.051005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2b342e94ca748678ef5724a9b44d18bbbf6a1b2b2faac4742f995d3159ee7ae","sha256:8dd497310ed297d257185f521c7b5beeab28105b63d6306530315ad5aba294d0"],"state_sha256":"cbc5a88bb7ff02161a87b6130b7a2857a1f81ff6e67f6ce00a49df8884adcdc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzaRIkYBEpq1y+EvZJDoi0Vd9qgokRvbUB7lsHum+7amjw6pr0IhhCK9PsldRwpCiot+mGr7iOxUO2IrH6hvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:32:03.074219Z","bundle_sha256":"08784e7cbdab919844c36dd6d3c07ef86e5479d2858c367140d131b2a00df521"}}