{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:I2DMH2ANPJYYXI5SNFMYXROSWJ","short_pith_number":"pith:I2DMH2AN","canonical_record":{"source":{"id":"2011.10446","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-20T15:20:23Z","cross_cats_sorted":[],"title_canon_sha256":"bf6bfcd6bdaa1e924c27ec8d7c322f9178ea7c255489a1a64a41376d76385ccb","abstract_canon_sha256":"cb1a76b0be6c12211d723da92722216970af8a977b75aee2891f70033ef1af3b"},"schema_version":"1.0"},"canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","source":{"kind":"arxiv","id":"2011.10446","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.10446","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2011.10446v2","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10446","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"I2DMH2ANPJYY","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"I2DMH2ANPJYYXI5S","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"I2DMH2AN","created_at":"2026-07-05T05:09:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:I2DMH2ANPJYYXI5SNFMYXROSWJ","target":"record","payload":{"canonical_record":{"source":{"id":"2011.10446","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-20T15:20:23Z","cross_cats_sorted":[],"title_canon_sha256":"bf6bfcd6bdaa1e924c27ec8d7c322f9178ea7c255489a1a64a41376d76385ccb","abstract_canon_sha256":"cb1a76b0be6c12211d723da92722216970af8a977b75aee2891f70033ef1af3b"},"schema_version":"1.0"},"canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:03.779252Z","signature_b64":"ryd0zHOMYBdRMp8nUQxFmQeCtfjGXkdTT9axA5ms3q3cpBxLciWtcQbqius8qGGywRNE+nxpnYNSmQ8nIKvfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","last_reissued_at":"2026-07-05T05:09:03.778830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:03.778830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.10446","source_version":2,"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-07-05T05:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQOI2psdnjD+UJEhFgo0zD09J7mEE4XLbeWl6mBMPCTEm+oYkvsGbpPzCKa+LM5Y5cFt+iTA38eQOuElE13SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T09:33:09.346647Z"},"content_sha256":"015f768835aa70e6d1ff4aee93e519fc0e841cd53dce8b099d73b339e5b283e7","schema_version":"1.0","event_id":"sha256:015f768835aa70e6d1ff4aee93e519fc0e841cd53dce8b099d73b339e5b283e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:I2DMH2ANPJYYXI5SNFMYXROSWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hop-Constrained Oblivious Routing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Mohsen Ghaffari","submitted_at":"2020-11-20T15:20:23Z","abstract_excerpt":"We prove the existence of an oblivious routing scheme that is $\\mathrm{poly}(\\log n)$-competitive in terms of $(congestion + dilation)$, thus resolving a well-known question in oblivious routing.\n  Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize $(congestion + dilation)$, defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10446","kind":"arxiv","version":2},"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/2011.10446/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-07-05T05:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsdK9JU9njq/uJcIiIpoo+sY9xxYtztfOjFkMOlvvpd33EdH/hgYegheuCDx+TnGb3B83kWP058JkwUW4Nl6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T09:33:09.347516Z"},"content_sha256":"fdae00304835b5e446a1bfb217d92de260b16b0619cfff5d283cd2e08d3b1cf8","schema_version":"1.0","event_id":"sha256:fdae00304835b5e446a1bfb217d92de260b16b0619cfff5d283cd2e08d3b1cf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/bundle.json","state_url":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/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-08-15T09:33:09Z","links":{"resolver":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ","bundle":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/bundle.json","state":"https://pith.science/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2DMH2ANPJYYXI5SNFMYXROSWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:I2DMH2ANPJYYXI5SNFMYXROSWJ","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":"cb1a76b0be6c12211d723da92722216970af8a977b75aee2891f70033ef1af3b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-20T15:20:23Z","title_canon_sha256":"bf6bfcd6bdaa1e924c27ec8d7c322f9178ea7c255489a1a64a41376d76385ccb"},"schema_version":"1.0","source":{"id":"2011.10446","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.10446","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2011.10446v2","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10446","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"I2DMH2ANPJYY","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"I2DMH2ANPJYYXI5S","created_at":"2026-07-05T05:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"I2DMH2AN","created_at":"2026-07-05T05:09:03Z"}],"graph_snapshots":[{"event_id":"sha256:fdae00304835b5e446a1bfb217d92de260b16b0619cfff5d283cd2e08d3b1cf8","target":"graph","created_at":"2026-07-05T05:09:03Z","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/2011.10446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove the existence of an oblivious routing scheme that is $\\mathrm{poly}(\\log n)$-competitive in terms of $(congestion + dilation)$, thus resolving a well-known question in oblivious routing.\n  Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize $(congestion + dilation)$, defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme ","authors_text":"Bernhard Haeupler, Goran Zuzic, Mohsen Ghaffari","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-20T15:20:23Z","title":"Hop-Constrained Oblivious Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10446","kind":"arxiv","version":2},"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:015f768835aa70e6d1ff4aee93e519fc0e841cd53dce8b099d73b339e5b283e7","target":"record","created_at":"2026-07-05T05:09:03Z","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":"cb1a76b0be6c12211d723da92722216970af8a977b75aee2891f70033ef1af3b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-20T15:20:23Z","title_canon_sha256":"bf6bfcd6bdaa1e924c27ec8d7c322f9178ea7c255489a1a64a41376d76385ccb"},"schema_version":"1.0","source":{"id":"2011.10446","kind":"arxiv","version":2}},"canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4686c3e80d7a718ba3b269598bc5d2b2744295e468c6ef79e1b57aa3f073bb6e","first_computed_at":"2026-07-05T05:09:03.778830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:09:03.778830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ryd0zHOMYBdRMp8nUQxFmQeCtfjGXkdTT9axA5ms3q3cpBxLciWtcQbqius8qGGywRNE+nxpnYNSmQ8nIKvfCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:09:03.779252Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.10446","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:015f768835aa70e6d1ff4aee93e519fc0e841cd53dce8b099d73b339e5b283e7","sha256:fdae00304835b5e446a1bfb217d92de260b16b0619cfff5d283cd2e08d3b1cf8"],"state_sha256":"74b2b14af676f5c3c6808cdcb0fbdbf9b273b4dff4212c89cc3c77edd68b513c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6YHaV8MmkGh1EIuoStN13dyJXweJADZ5r1aWMP+aqspJsT8c+QsimWLbuWLTdz0ZwroIuawTGNyw3DoSWH3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T09:33:09.354546Z","bundle_sha256":"b07c29bb7a97d91d3ba2115c66881bab60bdcdd772d738787f087d5c13c33716"}}