{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5TKDFMOCAAVGZVWHSHDSKHL6YI","short_pith_number":"pith:5TKDFMOC","canonical_record":{"source":{"id":"1812.09887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-24T10:48:44Z","cross_cats_sorted":[],"title_canon_sha256":"be6670013b9b43b8f41d34c00e62d5e5d41a0695b8c016203896dc9729b18a17","abstract_canon_sha256":"ae6a9a63e0f47db55139238853c8d734fcc0712a4f86a911c5829c510bb16da0"},"schema_version":"1.0"},"canonical_sha256":"ecd432b1c2002a6cd6c791c7251d7ec227de4c08c3c1ec1be0c278a5368156bf","source":{"kind":"arxiv","id":"1812.09887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09887","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09887v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09887","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"5TKDFMOCAAVG","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5TKDFMOCAAVGZVWH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5TKDFMOC","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5TKDFMOCAAVGZVWHSHDSKHL6YI","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-24T10:48:44Z","cross_cats_sorted":[],"title_canon_sha256":"be6670013b9b43b8f41d34c00e62d5e5d41a0695b8c016203896dc9729b18a17","abstract_canon_sha256":"ae6a9a63e0f47db55139238853c8d734fcc0712a4f86a911c5829c510bb16da0"},"schema_version":"1.0"},"canonical_sha256":"ecd432b1c2002a6cd6c791c7251d7ec227de4c08c3c1ec1be0c278a5368156bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:26.499722Z","signature_b64":"gU0bjEQIycbt5diYg0ffrLcQQnLcKbgfHbKg/vHq5EOlYLiRjDeEm18Lb1EmSPNtJq2my/0gzMrq2cZiqNr3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd432b1c2002a6cd6c791c7251d7ec227de4c08c3c1ec1be0c278a5368156bf","last_reissued_at":"2026-05-17T23:57:26.499175Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:26.499175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09887","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-17T23:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aZahzVfa+nLaQUuF5LtjH+PxnCa3pPXavS+vBnCwBGPHvFsDwgKwkffe73ikyqAVW26Ak3BYulGmoV9HKZbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:43.840029Z"},"content_sha256":"1cea444bbe86f9e3deacaaeb17e888e097cea2b836c6f2abc2b3eb7aa3037eb5","schema_version":"1.0","event_id":"sha256:1cea444bbe86f9e3deacaaeb17e888e097cea2b836c6f2abc2b3eb7aa3037eb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5TKDFMOCAAVGZVWHSHDSKHL6YI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Oblivious Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Harald R\\\"acke, Stefan Schmid","submitted_at":"2018-12-24T10:48:44Z","abstract_excerpt":"Oblivious routing is an attractive paradigm for large distributed systems in which centralized control and frequent reconfigurations are infeasible or undesired (e.g., costly). Over the last almost 20 years, much progress has been made in devising oblivious routing schemes that guarantee close to optimal load and also algorithms for constructing such schemes efficiently have been designed. However, a common drawback of existing oblivious routing schemes is that they are not compact: they require large routing tables (of polynomial size), which does not scale.\n  This paper presents the first ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09887","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-17T23:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsF6jDOuPK1R2xm2hjLogSG86+fFHCZhPw4Jnwm4DKWTc9U4WGckYgPeyVFr7PErtiDK+zXheTJmt9C9lcjZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:02:43.840849Z"},"content_sha256":"5fbde366bfa1d3b13ead01a2b986c9e5bc45006d9fb12e69756e17cfc9361bf2","schema_version":"1.0","event_id":"sha256:5fbde366bfa1d3b13ead01a2b986c9e5bc45006d9fb12e69756e17cfc9361bf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI/bundle.json","state_url":"https://pith.science/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI/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-11T06:02:43Z","links":{"resolver":"https://pith.science/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI","bundle":"https://pith.science/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI/bundle.json","state":"https://pith.science/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TKDFMOCAAVGZVWHSHDSKHL6YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5TKDFMOCAAVGZVWHSHDSKHL6YI","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":"ae6a9a63e0f47db55139238853c8d734fcc0712a4f86a911c5829c510bb16da0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-24T10:48:44Z","title_canon_sha256":"be6670013b9b43b8f41d34c00e62d5e5d41a0695b8c016203896dc9729b18a17"},"schema_version":"1.0","source":{"id":"1812.09887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09887","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09887v1","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09887","created_at":"2026-05-17T23:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"5TKDFMOCAAVG","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5TKDFMOCAAVGZVWH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5TKDFMOC","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:5fbde366bfa1d3b13ead01a2b986c9e5bc45006d9fb12e69756e17cfc9361bf2","target":"graph","created_at":"2026-05-17T23:57:26Z","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":"Oblivious routing is an attractive paradigm for large distributed systems in which centralized control and frequent reconfigurations are infeasible or undesired (e.g., costly). Over the last almost 20 years, much progress has been made in devising oblivious routing schemes that guarantee close to optimal load and also algorithms for constructing such schemes efficiently have been designed. However, a common drawback of existing oblivious routing schemes is that they are not compact: they require large routing tables (of polynomial size), which does not scale.\n  This paper presents the first ob","authors_text":"Harald R\\\"acke, Stefan Schmid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-24T10:48:44Z","title":"Compact Oblivious Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09887","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:1cea444bbe86f9e3deacaaeb17e888e097cea2b836c6f2abc2b3eb7aa3037eb5","target":"record","created_at":"2026-05-17T23:57:26Z","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":"ae6a9a63e0f47db55139238853c8d734fcc0712a4f86a911c5829c510bb16da0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-12-24T10:48:44Z","title_canon_sha256":"be6670013b9b43b8f41d34c00e62d5e5d41a0695b8c016203896dc9729b18a17"},"schema_version":"1.0","source":{"id":"1812.09887","kind":"arxiv","version":1}},"canonical_sha256":"ecd432b1c2002a6cd6c791c7251d7ec227de4c08c3c1ec1be0c278a5368156bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecd432b1c2002a6cd6c791c7251d7ec227de4c08c3c1ec1be0c278a5368156bf","first_computed_at":"2026-05-17T23:57:26.499175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:26.499175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gU0bjEQIycbt5diYg0ffrLcQQnLcKbgfHbKg/vHq5EOlYLiRjDeEm18Lb1EmSPNtJq2my/0gzMrq2cZiqNr3BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:26.499722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cea444bbe86f9e3deacaaeb17e888e097cea2b836c6f2abc2b3eb7aa3037eb5","sha256:5fbde366bfa1d3b13ead01a2b986c9e5bc45006d9fb12e69756e17cfc9361bf2"],"state_sha256":"88330b3e5ee59c0193818db93b3fc6eb8af769167b141132eca0158ce4e18db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91opuCh3aLNIjrJ6n1mAkCRTLBftBIKoc8h+CQe0M8USFXBBhcY1BF/PZJZMPnKJyw7Wk/Pbg6V3rzvHNmaiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:02:43.845186Z","bundle_sha256":"7106e316322ac7ff1c281696ebcffd2b90e146f59b8e0aa3103f1c87360647b5"}}