{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4TPUE4DBL6XQISXOPU7Z47AOD6","short_pith_number":"pith:4TPUE4DB","canonical_record":{"source":{"id":"2606.03674","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T13:59:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"25b9e5272966f55f45a497a3989bb1c08491b00008389fbe8185748f19817995","abstract_canon_sha256":"16e3a351e306df41b138e48f985958e0e1758c439bdae9e543c34967ed0bcae3"},"schema_version":"1.0"},"canonical_sha256":"e4df4270615faf044aee7d3f9e7c0e1f978232db9aa07ce97831b80e5340e266","source":{"kind":"arxiv","id":"2606.03674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03674","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03674v1","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03674","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"4TPUE4DBL6XQ","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"4TPUE4DBL6XQISXO","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"4TPUE4DB","created_at":"2026-06-03T01:06:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4TPUE4DBL6XQISXOPU7Z47AOD6","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03674","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T13:59:26Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"25b9e5272966f55f45a497a3989bb1c08491b00008389fbe8185748f19817995","abstract_canon_sha256":"16e3a351e306df41b138e48f985958e0e1758c439bdae9e543c34967ed0bcae3"},"schema_version":"1.0"},"canonical_sha256":"e4df4270615faf044aee7d3f9e7c0e1f978232db9aa07ce97831b80e5340e266","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:06:04.192603Z","signature_b64":"CzSMADy1TkKF0miqhnhoQbN/XE4v8+Kg/SLi9kjeC+TMPo3HOu3vTUXmw7PEqBClBvRCoQ9eqwrFJeOcGqxlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4df4270615faf044aee7d3f9e7c0e1f978232db9aa07ce97831b80e5340e266","last_reissued_at":"2026-06-03T01:06:04.192170Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:06:04.192170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03674","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-06-03T01:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W5x7WM8ggW5jlI+0qfGMOKzDkDH27NMRVZsdmlG912qlaamfeMjoPbvJxS+BnIgEZQJazidgqzhrDX1qa1wUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:37:43.495143Z"},"content_sha256":"95a7d615f8c05f9df6d08f75da85c7ef06dbe9a9996a45dba1e6e1aaafcd33d5","schema_version":"1.0","event_id":"sha256:95a7d615f8c05f9df6d08f75da85c7ef06dbe9a9996a45dba1e6e1aaafcd33d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4TPUE4DBL6XQISXOPU7Z47AOD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Distance Approximation in MPC via Improved Hitting Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Kyungjin Cho, Michal Dory, Tijn de Vos, Yannic Maus","submitted_at":"2026-06-02T13:59:26Z","abstract_excerpt":"In this paper, we provide the first deterministic algorithms with sublogarithmic round complexity for spanners and approximate shortest paths in various MPC models. Moreover, we significantly improve upon the state of the art in the deterministic Congested Clique. In particular, we obtain the following four results on undirected graphs: 1. In both linear MPC and Congested Clique, we obtain an $O(k)$ stretch-spanner of a weighted graph of size $O(n^{1+1/k})$ in $O(1)$ rounds, for some parameter $k\\ge 0$. For $k=O(\\log{n})$, this leads to an $O(\\log n)$ approximation of APSP in constant rounds i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03674","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/2606.03674/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-06-03T01:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJsk6q4aT8c5B/UXx+uKfjH1we0fJfSIPHyYO3snnZx/7mDUJtQjzUCFDX7SPP9spctHAnRRBqx0kp5UCd6YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T15:37:43.495942Z"},"content_sha256":"c53ca4d7bfe9035a87838f7451b2d55cbed6ca279dfc2658249eadb998c27e4e","schema_version":"1.0","event_id":"sha256:c53ca4d7bfe9035a87838f7451b2d55cbed6ca279dfc2658249eadb998c27e4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TPUE4DBL6XQISXOPU7Z47AOD6/bundle.json","state_url":"https://pith.science/pith/4TPUE4DBL6XQISXOPU7Z47AOD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TPUE4DBL6XQISXOPU7Z47AOD6/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-07T15:37:43Z","links":{"resolver":"https://pith.science/pith/4TPUE4DBL6XQISXOPU7Z47AOD6","bundle":"https://pith.science/pith/4TPUE4DBL6XQISXOPU7Z47AOD6/bundle.json","state":"https://pith.science/pith/4TPUE4DBL6XQISXOPU7Z47AOD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TPUE4DBL6XQISXOPU7Z47AOD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4TPUE4DBL6XQISXOPU7Z47AOD6","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":"16e3a351e306df41b138e48f985958e0e1758c439bdae9e543c34967ed0bcae3","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T13:59:26Z","title_canon_sha256":"25b9e5272966f55f45a497a3989bb1c08491b00008389fbe8185748f19817995"},"schema_version":"1.0","source":{"id":"2606.03674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03674","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03674v1","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03674","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"4TPUE4DBL6XQ","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"4TPUE4DBL6XQISXO","created_at":"2026-06-03T01:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"4TPUE4DB","created_at":"2026-06-03T01:06:04Z"}],"graph_snapshots":[{"event_id":"sha256:c53ca4d7bfe9035a87838f7451b2d55cbed6ca279dfc2658249eadb998c27e4e","target":"graph","created_at":"2026-06-03T01:06:04Z","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/2606.03674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we provide the first deterministic algorithms with sublogarithmic round complexity for spanners and approximate shortest paths in various MPC models. Moreover, we significantly improve upon the state of the art in the deterministic Congested Clique. In particular, we obtain the following four results on undirected graphs: 1. In both linear MPC and Congested Clique, we obtain an $O(k)$ stretch-spanner of a weighted graph of size $O(n^{1+1/k})$ in $O(1)$ rounds, for some parameter $k\\ge 0$. For $k=O(\\log{n})$, this leads to an $O(\\log n)$ approximation of APSP in constant rounds i","authors_text":"Kyungjin Cho, Michal Dory, Tijn de Vos, Yannic Maus","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T13:59:26Z","title":"Deterministic Distance Approximation in MPC via Improved Hitting Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03674","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:95a7d615f8c05f9df6d08f75da85c7ef06dbe9a9996a45dba1e6e1aaafcd33d5","target":"record","created_at":"2026-06-03T01:06:04Z","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":"16e3a351e306df41b138e48f985958e0e1758c439bdae9e543c34967ed0bcae3","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-02T13:59:26Z","title_canon_sha256":"25b9e5272966f55f45a497a3989bb1c08491b00008389fbe8185748f19817995"},"schema_version":"1.0","source":{"id":"2606.03674","kind":"arxiv","version":1}},"canonical_sha256":"e4df4270615faf044aee7d3f9e7c0e1f978232db9aa07ce97831b80e5340e266","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4df4270615faf044aee7d3f9e7c0e1f978232db9aa07ce97831b80e5340e266","first_computed_at":"2026-06-03T01:06:04.192170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:06:04.192170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CzSMADy1TkKF0miqhnhoQbN/XE4v8+Kg/SLi9kjeC+TMPo3HOu3vTUXmw7PEqBClBvRCoQ9eqwrFJeOcGqxlDA==","signature_status":"signed_v1","signed_at":"2026-06-03T01:06:04.192603Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a7d615f8c05f9df6d08f75da85c7ef06dbe9a9996a45dba1e6e1aaafcd33d5","sha256:c53ca4d7bfe9035a87838f7451b2d55cbed6ca279dfc2658249eadb998c27e4e"],"state_sha256":"b3373aca81b4c4c4953b0a249dd4f33e20f811ccb513bc244827ca54c810deb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vyNumCf6xewEzgCfvH9OwEREv81E7refcKQaEK7bEs6gw1h0yjbVr+P0AZrJqaQ0Mfv4tvPDJeP4gLDSW3KfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T15:37:43.504168Z","bundle_sha256":"be5a5b8c42d4428ddfb23066387ee8965fea5252f9a750fc077388da08d2f5e9"}}