{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SWCXZCJVN3GHM3XIFHFXFR3BX3","short_pith_number":"pith:SWCXZCJV","canonical_record":{"source":{"id":"1407.6730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T20:32:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"987313652441caddad336f16369ad57715126b8926e8c1a28fe0604c5ceb5aea","abstract_canon_sha256":"e8b23e0a1d52a08b9da1266f1bf558963bc80781e50b5c7ae33fe86c64a89cde"},"schema_version":"1.0"},"canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","source":{"kind":"arxiv","id":"1407.6730","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6730","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6730v3","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6730","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"SWCXZCJVN3GH","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SWCXZCJVN3GHM3XI","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SWCXZCJV","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SWCXZCJVN3GHM3XIFHFXFR3BX3","target":"record","payload":{"canonical_record":{"source":{"id":"1407.6730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T20:32:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"987313652441caddad336f16369ad57715126b8926e8c1a28fe0604c5ceb5aea","abstract_canon_sha256":"e8b23e0a1d52a08b9da1266f1bf558963bc80781e50b5c7ae33fe86c64a89cde"},"schema_version":"1.0"},"canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:57.534590Z","signature_b64":"DneITLrTl6ztNj2JeHp3QQ7R18iJcNL3EENupeg5gxQIH3xmcb9jVgMm9GXOZej5a03U4OLuRtleWPWztQFQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","last_reissued_at":"2026-05-18T02:45:57.534157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:57.534157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.6730","source_version":3,"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-18T02:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soS0Sz8I4O2x9RqpLUk8YFGX1Vdxchg89ADJ1TTZTW6TXy2BAUxvlfp34wJtGfDBeCIQ3lgqLDaBit9P9tmHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:59:43.904426Z"},"content_sha256":"9f8e36bae5444ff0ce71ea5fd3c196d56446f124c65e97f5ae35e791ae2f9240","schema_version":"1.0","event_id":"sha256:9f8e36bae5444ff0ce71ea5fd3c196d56446f124c65e97f5ae35e791ae2f9240"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SWCXZCJVN3GHM3XIFHFXFR3BX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New routing techniques and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Liam Roditty, Roei Tov","submitted_at":"2014-07-24T20:32:09Z","abstract_excerpt":"Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes:\n  - A routing scheme for unweighted graphs that uses $\\tilde O(\\frac{1}{\\epsilon} n^{2/3})$ space at each vertex and $\\tilde O(1/\\epsilon)$-bit headers, to route a message between any pair of vertices $u,v\\in V$ on a $(2 + \\epsilon,1)$-stretch path, i.e., a path of length at most $(2+\\epsilon)\\cdot d(u,v)+1$. This should be compared to the $(2,1)$-stretch and $\\tilde O(n^{5/3})$ space distance oracle of Patrascu and Roditty [FOCS'10 and SIAM J. Comput. 2014] and to the $(2,1)$-str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6730","kind":"arxiv","version":3},"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-18T02:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MgfS9OnUZMaCTfICup8khoaD8DkGQ7xiSUapxKkJnFyIZ4J33ZIeY1AfMGZXIGVevqS7/B4F0Mu9sQ3RHEhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:59:43.905057Z"},"content_sha256":"0e74f888accb2d95fbc9e7ec5358e42738e29dab0d756779f1c6a98fe4662468","schema_version":"1.0","event_id":"sha256:0e74f888accb2d95fbc9e7ec5358e42738e29dab0d756779f1c6a98fe4662468"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/bundle.json","state_url":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/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-11T14:59:43Z","links":{"resolver":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3","bundle":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/bundle.json","state":"https://pith.science/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWCXZCJVN3GHM3XIFHFXFR3BX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SWCXZCJVN3GHM3XIFHFXFR3BX3","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":"e8b23e0a1d52a08b9da1266f1bf558963bc80781e50b5c7ae33fe86c64a89cde","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T20:32:09Z","title_canon_sha256":"987313652441caddad336f16369ad57715126b8926e8c1a28fe0604c5ceb5aea"},"schema_version":"1.0","source":{"id":"1407.6730","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6730","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6730v3","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6730","created_at":"2026-05-18T02:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"SWCXZCJVN3GH","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SWCXZCJVN3GHM3XI","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SWCXZCJV","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:0e74f888accb2d95fbc9e7ec5358e42738e29dab0d756779f1c6a98fe4662468","target":"graph","created_at":"2026-05-18T02:45:57Z","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":"Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes:\n  - A routing scheme for unweighted graphs that uses $\\tilde O(\\frac{1}{\\epsilon} n^{2/3})$ space at each vertex and $\\tilde O(1/\\epsilon)$-bit headers, to route a message between any pair of vertices $u,v\\in V$ on a $(2 + \\epsilon,1)$-stretch path, i.e., a path of length at most $(2+\\epsilon)\\cdot d(u,v)+1$. This should be compared to the $(2,1)$-stretch and $\\tilde O(n^{5/3})$ space distance oracle of Patrascu and Roditty [FOCS'10 and SIAM J. Comput. 2014] and to the $(2,1)$-str","authors_text":"Liam Roditty, Roei Tov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T20:32:09Z","title":"New routing techniques and their applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6730","kind":"arxiv","version":3},"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:9f8e36bae5444ff0ce71ea5fd3c196d56446f124c65e97f5ae35e791ae2f9240","target":"record","created_at":"2026-05-18T02:45:57Z","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":"e8b23e0a1d52a08b9da1266f1bf558963bc80781e50b5c7ae33fe86c64a89cde","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-24T20:32:09Z","title_canon_sha256":"987313652441caddad336f16369ad57715126b8926e8c1a28fe0604c5ceb5aea"},"schema_version":"1.0","source":{"id":"1407.6730","kind":"arxiv","version":3}},"canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95857c89356ecc766ee829cb72c761bec624b805d41e7c85dbdcde70880dccaa","first_computed_at":"2026-05-18T02:45:57.534157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:57.534157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DneITLrTl6ztNj2JeHp3QQ7R18iJcNL3EENupeg5gxQIH3xmcb9jVgMm9GXOZej5a03U4OLuRtleWPWztQFQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:57.534590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6730","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f8e36bae5444ff0ce71ea5fd3c196d56446f124c65e97f5ae35e791ae2f9240","sha256:0e74f888accb2d95fbc9e7ec5358e42738e29dab0d756779f1c6a98fe4662468"],"state_sha256":"619798844590fa49b1b682b1cdf585d75c927decc1e98a2d11dbb31ff20592d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtvnwsG39JIYbA1jt1UDjyAHKx1RWBLeQSU+u0k8WC5ivD4LXv8cGDP9U/UZYahX9jdJVWIUL6PVs6CZ5NleDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:59:43.908503Z","bundle_sha256":"867f1371fd2921780137e6467d2607fec1b9741db751d87ac90a855825e59617"}}