{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RWUZD2F3REETMYCWW5BLXVLL4C","short_pith_number":"pith:RWUZD2F3","canonical_record":{"source":{"id":"1010.0401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-03T13:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"0496f0167e52a2a58ae5bb2574adacf2cbb7dcbc9c4fea7a1ccc0e3fd0e5b4f8","abstract_canon_sha256":"55a2a32a93ca0d20496d23b9a33e2fe1836da67020e635b1bbff47792ef3a16a"},"schema_version":"1.0"},"canonical_sha256":"8da991e8bb8909366056b742bbd56be0af6b28ce286ba14c3bc492bada249798","source":{"kind":"arxiv","id":"1010.0401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0401","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0401v1","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0401","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"RWUZD2F3REET","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RWUZD2F3REETMYCW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RWUZD2F3","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RWUZD2F3REETMYCWW5BLXVLL4C","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-03T13:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"0496f0167e52a2a58ae5bb2574adacf2cbb7dcbc9c4fea7a1ccc0e3fd0e5b4f8","abstract_canon_sha256":"55a2a32a93ca0d20496d23b9a33e2fe1836da67020e635b1bbff47792ef3a16a"},"schema_version":"1.0"},"canonical_sha256":"8da991e8bb8909366056b742bbd56be0af6b28ce286ba14c3bc492bada249798","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:47.651061Z","signature_b64":"S00zh6YpwM0nX5B2VoTSiHer3X0fL49Je8HzbuWKgLrRHtC1Cv9MsUz1Z5BPjxeRAMLMI+GeV6gZQutk3JkRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8da991e8bb8909366056b742bbd56be0af6b28ce286ba14c3bc492bada249798","last_reissued_at":"2026-05-18T02:23:47.650441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:47.650441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0401","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-18T02:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVC3RVHlPisYEQxXzUXIk0sqP+kcrU8feHico+USfTbWbf+0/jeQ8YT2vUajCRXVg5anF47WGgMNk4GSEE3/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:20:17.276764Z"},"content_sha256":"6d9ddaa370ec29451301236eedba6c1e4b83f76442a866c3d68f693ae95114c2","schema_version":"1.0","event_id":"sha256:6d9ddaa370ec29451301236eedba6c1e4b83f76442a866c3d68f693ae95114c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RWUZD2F3REETMYCWW5BLXVLL4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Oblivious Buy-at-Bulk in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas Busch, Srivathsan Srinivasagopalan, S.S. Iyengar","submitted_at":"2010-10-03T13:43:00Z","abstract_excerpt":"In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destinations in the graph, such that any set of demands can be routed along these paths. The demands could be aggregated at intermediate edges where the fusion-cost is specified by a canonical (non-negative concave) function $f$. We give a novel algorithm for planar graphs which is oblivious with respect to the demands, and is also oblivious with respect to the fusion function $f$. The algorithm is deterministic and computes the fixed set of paths in polynomial t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0401","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-18T02:23:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZ4Ec+hsk0B4Qgymhn2O4rYrQHN6Xw34suFJ9Pp924SDt3086o9f0zHspw4dmJCrF1+jk/dqNCq2skkdaFUaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:20:17.277492Z"},"content_sha256":"27e87b3aeeba7ba27ff89e30a3cec77bd8a59b94f1f94cdaa5a6825fed7e2ecc","schema_version":"1.0","event_id":"sha256:27e87b3aeeba7ba27ff89e30a3cec77bd8a59b94f1f94cdaa5a6825fed7e2ecc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWUZD2F3REETMYCWW5BLXVLL4C/bundle.json","state_url":"https://pith.science/pith/RWUZD2F3REETMYCWW5BLXVLL4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWUZD2F3REETMYCWW5BLXVLL4C/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-05-31T05:20:17Z","links":{"resolver":"https://pith.science/pith/RWUZD2F3REETMYCWW5BLXVLL4C","bundle":"https://pith.science/pith/RWUZD2F3REETMYCWW5BLXVLL4C/bundle.json","state":"https://pith.science/pith/RWUZD2F3REETMYCWW5BLXVLL4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWUZD2F3REETMYCWW5BLXVLL4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RWUZD2F3REETMYCWW5BLXVLL4C","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":"55a2a32a93ca0d20496d23b9a33e2fe1836da67020e635b1bbff47792ef3a16a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-03T13:43:00Z","title_canon_sha256":"0496f0167e52a2a58ae5bb2574adacf2cbb7dcbc9c4fea7a1ccc0e3fd0e5b4f8"},"schema_version":"1.0","source":{"id":"1010.0401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0401","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0401v1","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0401","created_at":"2026-05-18T02:23:47Z"},{"alias_kind":"pith_short_12","alias_value":"RWUZD2F3REET","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RWUZD2F3REETMYCW","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RWUZD2F3","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:27e87b3aeeba7ba27ff89e30a3cec77bd8a59b94f1f94cdaa5a6825fed7e2ecc","target":"graph","created_at":"2026-05-18T02:23:47Z","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":"In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destinations in the graph, such that any set of demands can be routed along these paths. The demands could be aggregated at intermediate edges where the fusion-cost is specified by a canonical (non-negative concave) function $f$. We give a novel algorithm for planar graphs which is oblivious with respect to the demands, and is also oblivious with respect to the fusion function $f$. The algorithm is deterministic and computes the fixed set of paths in polynomial t","authors_text":"Costas Busch, Srivathsan Srinivasagopalan, S.S. Iyengar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-03T13:43:00Z","title":"Oblivious Buy-at-Bulk in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0401","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:6d9ddaa370ec29451301236eedba6c1e4b83f76442a866c3d68f693ae95114c2","target":"record","created_at":"2026-05-18T02:23:47Z","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":"55a2a32a93ca0d20496d23b9a33e2fe1836da67020e635b1bbff47792ef3a16a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-03T13:43:00Z","title_canon_sha256":"0496f0167e52a2a58ae5bb2574adacf2cbb7dcbc9c4fea7a1ccc0e3fd0e5b4f8"},"schema_version":"1.0","source":{"id":"1010.0401","kind":"arxiv","version":1}},"canonical_sha256":"8da991e8bb8909366056b742bbd56be0af6b28ce286ba14c3bc492bada249798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8da991e8bb8909366056b742bbd56be0af6b28ce286ba14c3bc492bada249798","first_computed_at":"2026-05-18T02:23:47.650441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:47.650441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S00zh6YpwM0nX5B2VoTSiHer3X0fL49Je8HzbuWKgLrRHtC1Cv9MsUz1Z5BPjxeRAMLMI+GeV6gZQutk3JkRAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:47.651061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d9ddaa370ec29451301236eedba6c1e4b83f76442a866c3d68f693ae95114c2","sha256:27e87b3aeeba7ba27ff89e30a3cec77bd8a59b94f1f94cdaa5a6825fed7e2ecc"],"state_sha256":"d1cff2faa768f01237de10778a92f2bb0e0a013d12ec2041b1b49c0d5b3f8b0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kOH04VPYjI7rT3DQ51oI0lsVVxeaJr3hLQbFUH016QmudmCXZLF83lwigy82UwQ72Qxak52ZSJnxlej0JsyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:20:17.281026Z","bundle_sha256":"6a722927febe61d20f4ab7f8ac90529e16cafcd21a7957d81c4bf6fd76a210f3"}}