{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:H5XUICYSRRR3ZFNPDPGZ2TVI53","short_pith_number":"pith:H5XUICYS","canonical_record":{"source":{"id":"0909.2859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-09-15T19:50:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9b2615eb9862d97f1242c6e054a3186116f9d10c3d6d065f5961d5bd27435fc6","abstract_canon_sha256":"f2b62ca5560d09c7ca2200ca40bd3bcf99fda50ad7f3fbe7eb0b504f359b460b"},"schema_version":"1.0"},"canonical_sha256":"3f6f440b128c63bc95af1bcd9d4ea8eeef06f356d1002a9575a3e06a721ed7a8","source":{"kind":"arxiv","id":"0909.2859","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.2859","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"0909.2859v1","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2859","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"H5XUICYSRRR3","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"pith_short_16","alias_value":"H5XUICYSRRR3ZFNP","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"pith_short_8","alias_value":"H5XUICYS","created_at":"2026-07-04T15:49:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:H5XUICYSRRR3ZFNPDPGZ2TVI53","target":"record","payload":{"canonical_record":{"source":{"id":"0909.2859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-09-15T19:50:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9b2615eb9862d97f1242c6e054a3186116f9d10c3d6d065f5961d5bd27435fc6","abstract_canon_sha256":"f2b62ca5560d09c7ca2200ca40bd3bcf99fda50ad7f3fbe7eb0b504f359b460b"},"schema_version":"1.0"},"canonical_sha256":"3f6f440b128c63bc95af1bcd9d4ea8eeef06f356d1002a9575a3e06a721ed7a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:49:44.343323Z","signature_b64":"OpQv++rk/RSaWQYyaYelhQD3pe3bsde33mdNUa/mgNQ6YVwhDOQBNkI+YgU5SeRSsZd4xotPHD+q05aCrTXxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f6f440b128c63bc95af1bcd9d4ea8eeef06f356d1002a9575a3e06a721ed7a8","last_reissued_at":"2026-07-04T15:49:44.342947Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:49:44.342947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.2859","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-07-04T15:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfIDTUDR7WE5B6hWg5RDCsU8vr0xHAGW9LeqkkKnvc61XnE79LY1UOKPg3g0QdS7oI/EI6TbDhEobdP1CHjFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:03:27.469162Z"},"content_sha256":"601937b76d2097c9a5c9bd644c68e3db74ecb67943dd5e27d5f8d717190ae3f9","schema_version":"1.0","event_id":"sha256:601937b76d2097c9a5c9bd644c68e3db74ecb67943dd5e27d5f8d717190ae3f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:H5XUICYSRRR3ZFNPDPGZ2TVI53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Electric routing and concurrent flow cutting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DM","authors_text":"Jonathan Kelner, Petar Maymounkov","submitted_at":"2009-09-15T19:50:37Z","abstract_excerpt":"We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the L1->L1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2859","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0909.2859/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-04T15:49:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DqytKoaOl0KlZY6j8t7CHAmrfvaF4kA02TKNsoO2uSLLWf2CfmUSKQcQfvSEMmDaQUcTlMhvrqam8OdZAxaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:03:27.469664Z"},"content_sha256":"e31ef4b63c3dfcde034daf5679a638450a3b9d98714b0e7cbafec9e4c91baf07","schema_version":"1.0","event_id":"sha256:e31ef4b63c3dfcde034daf5679a638450a3b9d98714b0e7cbafec9e4c91baf07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53/bundle.json","state_url":"https://pith.science/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53/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-03T19:03:27Z","links":{"resolver":"https://pith.science/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53","bundle":"https://pith.science/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53/bundle.json","state":"https://pith.science/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5XUICYSRRR3ZFNPDPGZ2TVI53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:H5XUICYSRRR3ZFNPDPGZ2TVI53","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":"f2b62ca5560d09c7ca2200ca40bd3bcf99fda50ad7f3fbe7eb0b504f359b460b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-09-15T19:50:37Z","title_canon_sha256":"9b2615eb9862d97f1242c6e054a3186116f9d10c3d6d065f5961d5bd27435fc6"},"schema_version":"1.0","source":{"id":"0909.2859","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.2859","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"arxiv_version","alias_value":"0909.2859v1","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2859","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"pith_short_12","alias_value":"H5XUICYSRRR3","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"pith_short_16","alias_value":"H5XUICYSRRR3ZFNP","created_at":"2026-07-04T15:49:44Z"},{"alias_kind":"pith_short_8","alias_value":"H5XUICYS","created_at":"2026-07-04T15:49:44Z"}],"graph_snapshots":[{"event_id":"sha256:e31ef4b63c3dfcde034daf5679a638450a3b9d98714b0e7cbafec9e4c91baf07","target":"graph","created_at":"2026-07-04T15:49:44Z","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/0909.2859/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the L1->L1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.","authors_text":"Jonathan Kelner, Petar Maymounkov","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-09-15T19:50:37Z","title":"Electric routing and concurrent flow cutting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2859","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:601937b76d2097c9a5c9bd644c68e3db74ecb67943dd5e27d5f8d717190ae3f9","target":"record","created_at":"2026-07-04T15:49:44Z","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":"f2b62ca5560d09c7ca2200ca40bd3bcf99fda50ad7f3fbe7eb0b504f359b460b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-09-15T19:50:37Z","title_canon_sha256":"9b2615eb9862d97f1242c6e054a3186116f9d10c3d6d065f5961d5bd27435fc6"},"schema_version":"1.0","source":{"id":"0909.2859","kind":"arxiv","version":1}},"canonical_sha256":"3f6f440b128c63bc95af1bcd9d4ea8eeef06f356d1002a9575a3e06a721ed7a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f6f440b128c63bc95af1bcd9d4ea8eeef06f356d1002a9575a3e06a721ed7a8","first_computed_at":"2026-07-04T15:49:44.342947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:49:44.342947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OpQv++rk/RSaWQYyaYelhQD3pe3bsde33mdNUa/mgNQ6YVwhDOQBNkI+YgU5SeRSsZd4xotPHD+q05aCrTXxCA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:49:44.343323Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.2859","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:601937b76d2097c9a5c9bd644c68e3db74ecb67943dd5e27d5f8d717190ae3f9","sha256:e31ef4b63c3dfcde034daf5679a638450a3b9d98714b0e7cbafec9e4c91baf07"],"state_sha256":"7417f575e4e45f09c24d3bc53b1dcb735a4637cd5ed9a6dea1f4fbce867a6aa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TP+XMuW5bfrf4btrjD3tOgEiLmm9Myiqxh6XQ5SWHNXj4sQwCjkr75UIdlRB9FsoCwXjaUNP1AbgPKJrphbuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:03:27.473407Z","bundle_sha256":"67312e53aa4f93b6f6940fe9b6f1d20dc098e3c3da22453341003cadb934c798"}}