{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4YBZCFQGBU3MUTGEMUG2TUYQFP","short_pith_number":"pith:4YBZCFQG","canonical_record":{"source":{"id":"1712.02076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-06T07:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"379336d1def30887472410b9a2de1fd0ec7b0a9a6ebbc048a034ce658baf609f","abstract_canon_sha256":"a87f532e03a4e58a27af3a87cefedd0c851af4c0dca0d67bfa7e727491493ca4"},"schema_version":"1.0"},"canonical_sha256":"e6039116060d36ca4cc4650da9d3102bcb675a93e8a66bc45365a5139773298e","source":{"kind":"arxiv","id":"1712.02076","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02076","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02076v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02076","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"4YBZCFQGBU3M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4YBZCFQGBU3MUTGE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4YBZCFQG","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4YBZCFQGBU3MUTGEMUG2TUYQFP","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02076","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-06T07:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"379336d1def30887472410b9a2de1fd0ec7b0a9a6ebbc048a034ce658baf609f","abstract_canon_sha256":"a87f532e03a4e58a27af3a87cefedd0c851af4c0dca0d67bfa7e727491493ca4"},"schema_version":"1.0"},"canonical_sha256":"e6039116060d36ca4cc4650da9d3102bcb675a93e8a66bc45365a5139773298e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:39.269125Z","signature_b64":"Q7M8jVf5Epigkt0e28TjRhnxlnBPBfcbNEoXz7FWPUTbB0sPosWcgNbhF0+IIF2mjGXkAgBej0hhv7hCkurtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6039116060d36ca4cc4650da9d3102bcb675a93e8a66bc45365a5139773298e","last_reissued_at":"2026-05-18T00:28:39.268346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:39.268346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02076","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:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R8a2ntW4oMOU+Dnz8qm3dkzT3Nflbf4TQEx9enVLCwOnfVgQzzmc46LFfbYLzXT15bAa1uWz7jykVMVBhzcXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:24:33.884141Z"},"content_sha256":"dc332364d45aba83c5d733da7dfc9ddb406e7d09b0c05cf6af5546f4958c5ccc","schema_version":"1.0","event_id":"sha256:dc332364d45aba83c5d733da7dfc9ddb406e7d09b0c05cf6af5546f4958c5ccc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4YBZCFQGBU3MUTGEMUG2TUYQFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Oblivious Routing via Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gal Shahaf, Michael Schapira","submitted_at":"2017-12-06T07:56:43Z","abstract_excerpt":"We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for \\emph{unsplittable} multicommodity flow is the first oblivious routing algorithm for this setting. As an intermediate step towards this algorithm, we present a novel generalization of Valiant's classical load balancing scheme for packet-switched networks to arbitrary graphs, which is of independent interest. Our algorithm for minimizing congestion for \\emph{splittable} multicommodity flow improves upon the state-of-the-art, in terms of both running"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02076","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:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YWlnmM9b7SQlAPCuhZd3hKC4I3Sij8lqNaxao082ZJoMBlDaSQCjXms4hDnI+as7aT6gojrqj8XkSp8IPU+oDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:24:33.884504Z"},"content_sha256":"f3633e4a2d64ac34af54b3c77f8fb0f86885de9055e36709f22bebf0802223ee","schema_version":"1.0","event_id":"sha256:f3633e4a2d64ac34af54b3c77f8fb0f86885de9055e36709f22bebf0802223ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP/bundle.json","state_url":"https://pith.science/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP/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-02T11:24:33Z","links":{"resolver":"https://pith.science/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP","bundle":"https://pith.science/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP/bundle.json","state":"https://pith.science/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YBZCFQGBU3MUTGEMUG2TUYQFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4YBZCFQGBU3MUTGEMUG2TUYQFP","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":"a87f532e03a4e58a27af3a87cefedd0c851af4c0dca0d67bfa7e727491493ca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-06T07:56:43Z","title_canon_sha256":"379336d1def30887472410b9a2de1fd0ec7b0a9a6ebbc048a034ce658baf609f"},"schema_version":"1.0","source":{"id":"1712.02076","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02076","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02076v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02076","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"4YBZCFQGBU3M","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4YBZCFQGBU3MUTGE","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4YBZCFQG","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:f3633e4a2d64ac34af54b3c77f8fb0f86885de9055e36709f22bebf0802223ee","target":"graph","created_at":"2026-05-18T00:28:39Z","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":"We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for \\emph{unsplittable} multicommodity flow is the first oblivious routing algorithm for this setting. As an intermediate step towards this algorithm, we present a novel generalization of Valiant's classical load balancing scheme for packet-switched networks to arbitrary graphs, which is of independent interest. Our algorithm for minimizing congestion for \\emph{splittable} multicommodity flow improves upon the state-of-the-art, in terms of both running","authors_text":"Gal Shahaf, Michael Schapira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-06T07:56:43Z","title":"Oblivious Routing via Random Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02076","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:dc332364d45aba83c5d733da7dfc9ddb406e7d09b0c05cf6af5546f4958c5ccc","target":"record","created_at":"2026-05-18T00:28:39Z","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":"a87f532e03a4e58a27af3a87cefedd0c851af4c0dca0d67bfa7e727491493ca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-06T07:56:43Z","title_canon_sha256":"379336d1def30887472410b9a2de1fd0ec7b0a9a6ebbc048a034ce658baf609f"},"schema_version":"1.0","source":{"id":"1712.02076","kind":"arxiv","version":1}},"canonical_sha256":"e6039116060d36ca4cc4650da9d3102bcb675a93e8a66bc45365a5139773298e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6039116060d36ca4cc4650da9d3102bcb675a93e8a66bc45365a5139773298e","first_computed_at":"2026-05-18T00:28:39.268346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:39.268346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q7M8jVf5Epigkt0e28TjRhnxlnBPBfcbNEoXz7FWPUTbB0sPosWcgNbhF0+IIF2mjGXkAgBej0hhv7hCkurtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:39.269125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02076","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc332364d45aba83c5d733da7dfc9ddb406e7d09b0c05cf6af5546f4958c5ccc","sha256:f3633e4a2d64ac34af54b3c77f8fb0f86885de9055e36709f22bebf0802223ee"],"state_sha256":"5fc000f867603434654af8ce92ea27b1ab28a9da34caa5cf60a02e9d1e5a5726"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VirwTMl6IYC55R+t9LRv7mtCBDK64ZF9AdbrJO9/MiNf8KyHkFE1kM27mOovUmeYKmlqna7aKJZxAbzVOyi9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:24:33.886707Z","bundle_sha256":"3fb1ebeeb01e08290ab4678286569a80ff2ac943b26ebd8d16ea3d5be55a984a"}}