{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PIEAR2WWFSWG2MRU22XPRLVZLR","short_pith_number":"pith:PIEAR2WW","canonical_record":{"source":{"id":"1207.1852","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-08T07:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"999274d3d41e6518c6e37b81d0d104d7046b120cde46fb26a45d19cb4fe115c9","abstract_canon_sha256":"6102a1f647ec7691ac2b7a34d07d433384c51fdcc50969e553a01549af63398c"},"schema_version":"1.0"},"canonical_sha256":"7a0808ead62cac6d3234d6aef8aeb95c754bb3d38beb70f30da811017d590a7b","source":{"kind":"arxiv","id":"1207.1852","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1852","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1852v4","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1852","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"PIEAR2WWFSWG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PIEAR2WWFSWG2MRU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PIEAR2WW","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PIEAR2WWFSWG2MRU22XPRLVZLR","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1852","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-08T07:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"999274d3d41e6518c6e37b81d0d104d7046b120cde46fb26a45d19cb4fe115c9","abstract_canon_sha256":"6102a1f647ec7691ac2b7a34d07d433384c51fdcc50969e553a01549af63398c"},"schema_version":"1.0"},"canonical_sha256":"7a0808ead62cac6d3234d6aef8aeb95c754bb3d38beb70f30da811017d590a7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:00.367468Z","signature_b64":"Ekizj7N4TZm2Q8e6UCtJm3cRJfJ/E1asG3w4zHS5i0YUp5YK2/98fErsazzrsA/+ePm0wZ36kDlKDOK5hkqtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a0808ead62cac6d3234d6aef8aeb95c754bb3d38beb70f30da811017d590a7b","last_reissued_at":"2026-05-18T03:26:00.367023Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:00.367023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1852","source_version":4,"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-18T03:26:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xs6IUVTcgrwxIBHqgn4qHsRZu+EH+PinJPyLYPKK5yxyQQvMbnKIZHkLv9Faa2v5gA7+gkoIyCqIkRKUjIY8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:08.955259Z"},"content_sha256":"bba004a3128b39f8449625b336cb178cade9c421b207a37e35e398a42238d623","schema_version":"1.0","event_id":"sha256:bba004a3128b39f8449625b336cb178cade9c421b207a37e35e398a42238d623"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PIEAR2WWFSWG2MRU22XPRLVZLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Deterministic Routing and Sorting on the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen","submitted_at":"2012-07-08T07:49:22Z","abstract_excerpt":"Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) bits. We provide deterministic constant-time solutions for two problems in this model. The first is a routing problem where each node is source and destination of n messages of size O(log n). The second is a sorting problem where each node i is given n keys of size O(log n) and needs to receive the ith batch of n keys according to the global order of the keys. The latter result also implies deterministic constant-round solutions for related problems such as selection or determining modes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1852","kind":"arxiv","version":4},"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-18T03:26:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUgzaCCf8p+6u8n95cSTmrKNGGupgx5zp80q1mC793oWiy0m+wBd1eYx42UN18vrF/Zu0/u7w3aHlZbyfEQbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:36:08.955930Z"},"content_sha256":"83c903b8eea4596741ed8c311dc3f8cc7dc3941fae8540d65a6294c06d6b21df","schema_version":"1.0","event_id":"sha256:83c903b8eea4596741ed8c311dc3f8cc7dc3941fae8540d65a6294c06d6b21df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIEAR2WWFSWG2MRU22XPRLVZLR/bundle.json","state_url":"https://pith.science/pith/PIEAR2WWFSWG2MRU22XPRLVZLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIEAR2WWFSWG2MRU22XPRLVZLR/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-28T23:36:08Z","links":{"resolver":"https://pith.science/pith/PIEAR2WWFSWG2MRU22XPRLVZLR","bundle":"https://pith.science/pith/PIEAR2WWFSWG2MRU22XPRLVZLR/bundle.json","state":"https://pith.science/pith/PIEAR2WWFSWG2MRU22XPRLVZLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIEAR2WWFSWG2MRU22XPRLVZLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PIEAR2WWFSWG2MRU22XPRLVZLR","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":"6102a1f647ec7691ac2b7a34d07d433384c51fdcc50969e553a01549af63398c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-08T07:49:22Z","title_canon_sha256":"999274d3d41e6518c6e37b81d0d104d7046b120cde46fb26a45d19cb4fe115c9"},"schema_version":"1.0","source":{"id":"1207.1852","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1852","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1852v4","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1852","created_at":"2026-05-18T03:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"PIEAR2WWFSWG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PIEAR2WWFSWG2MRU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PIEAR2WW","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:83c903b8eea4596741ed8c311dc3f8cc7dc3941fae8540d65a6294c06d6b21df","target":"graph","created_at":"2026-05-18T03:26:00Z","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":"Consider a clique of n nodes, where in each synchronous round each pair of nodes can exchange O(log n) bits. We provide deterministic constant-time solutions for two problems in this model. The first is a routing problem where each node is source and destination of n messages of size O(log n). The second is a sorting problem where each node i is given n keys of size O(log n) and needs to receive the ith batch of n keys according to the global order of the keys. The latter result also implies deterministic constant-round solutions for related problems such as selection or determining modes.","authors_text":"Christoph Lenzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-08T07:49:22Z","title":"Optimal Deterministic Routing and Sorting on the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1852","kind":"arxiv","version":4},"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:bba004a3128b39f8449625b336cb178cade9c421b207a37e35e398a42238d623","target":"record","created_at":"2026-05-18T03:26:00Z","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":"6102a1f647ec7691ac2b7a34d07d433384c51fdcc50969e553a01549af63398c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-07-08T07:49:22Z","title_canon_sha256":"999274d3d41e6518c6e37b81d0d104d7046b120cde46fb26a45d19cb4fe115c9"},"schema_version":"1.0","source":{"id":"1207.1852","kind":"arxiv","version":4}},"canonical_sha256":"7a0808ead62cac6d3234d6aef8aeb95c754bb3d38beb70f30da811017d590a7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a0808ead62cac6d3234d6aef8aeb95c754bb3d38beb70f30da811017d590a7b","first_computed_at":"2026-05-18T03:26:00.367023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:00.367023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ekizj7N4TZm2Q8e6UCtJm3cRJfJ/E1asG3w4zHS5i0YUp5YK2/98fErsazzrsA/+ePm0wZ36kDlKDOK5hkqtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:00.367468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1852","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bba004a3128b39f8449625b336cb178cade9c421b207a37e35e398a42238d623","sha256:83c903b8eea4596741ed8c311dc3f8cc7dc3941fae8540d65a6294c06d6b21df"],"state_sha256":"c3de9290294657b4c4bb1afa10b560479bc001135c8116cf1d72415971be998a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+LW24GQbyz6dxxgLzzVASYNAeG92lPlo5DVeqBEApyPDKV4BMm+lH6S/mRonYg6UDKnBJivrHejVo5nN2A8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:36:08.959707Z","bundle_sha256":"735cb58640ed940d586fd670e445c640c92440664981b18bc8d7c9b41df96187"}}