{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:AL3IPAM2NTWWH3KXEC5LPUK5QU","short_pith_number":"pith:AL3IPAM2","canonical_record":{"source":{"id":"0901.1140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-08T21:23:37Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"264b98a11de33f59180e194f7417e0c71aa8dd7d566bb8428b9d38b9778ab227","abstract_canon_sha256":"26cc0c69dcf79ae43376f18644c29115275ef7b440de352e2d1c82fc677a0c97"},"schema_version":"1.0"},"canonical_sha256":"02f687819a6ced63ed5720bab7d15d853c4e383a3599dd74a943e214c6112693","source":{"kind":"arxiv","id":"0901.1140","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.1140","created_at":"2026-05-18T02:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"0901.1140v3","created_at":"2026-05-18T02:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.1140","created_at":"2026-05-18T02:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"AL3IPAM2NTWW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"AL3IPAM2NTWWH3KX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"AL3IPAM2","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:AL3IPAM2NTWWH3KXEC5LPUK5QU","target":"record","payload":{"canonical_record":{"source":{"id":"0901.1140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-08T21:23:37Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"264b98a11de33f59180e194f7417e0c71aa8dd7d566bb8428b9d38b9778ab227","abstract_canon_sha256":"26cc0c69dcf79ae43376f18644c29115275ef7b440de352e2d1c82fc677a0c97"},"schema_version":"1.0"},"canonical_sha256":"02f687819a6ced63ed5720bab7d15d853c4e383a3599dd74a943e214c6112693","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:15:02.854894Z","signature_b64":"n6t7H+/p8bq+88R/ixn7PM+QunrslO3qU5sQDmP7sxNhEMPELtfKB5U2qVfZtrNiF6pkuHYior887xd8cgG4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f687819a6ced63ed5720bab7d15d853c4e383a3599dd74a943e214c6112693","last_reissued_at":"2026-05-18T02:15:02.854472Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:15:02.854472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.1140","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:15:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6wZ8VOgLuSTC49JhKrDWc56nX4cdLwXP7nWbd9LkjJII8RSVn7bF18NaLSCJwKqR7uZQBXz9QRsvavWugDZBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:54:31.108046Z"},"content_sha256":"fb35a6f13147d1cc9341a355a04fb46cc5bd77a574dafb691969722e1b9ce2d0","schema_version":"1.0","event_id":"sha256:fb35a6f13147d1cc9341a355a04fb46cc5bd77a574dafb691969722e1b9ce2d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:AL3IPAM2NTWWH3KXEC5LPUK5QU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Profit-Maximizing Pricing for the Highway and Tollbooth Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Khaled Elbassioni, Rajiv Raman, Rene Sitters, Saurabh Ray","submitted_at":"2009-01-08T21:23:37Z","abstract_excerpt":"In the \\emph{tollbooth problem}, we are given a tree $\\bT=(V,E)$ with $n$ edges, and a set of $m$ customers, each of whom is interested in purchasing a path on the tree. Each customer has a fixed budget, and the objective is to price the edges of $\\bT$ such that the total revenue made by selling the paths to the customers that can afford them is maximized. An important special case of this problem, known as the \\emph{highway problem}, is when $\\bT$ is restricted to be a line.\n  For the tollbooth problem, we present a randomized $O(\\log n)$-approximation, improving on the current best $O(\\log m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.1140","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:15:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/UJMeKUaYtgyPh+/hkPCOc4mCGCrzOtychbo/54688qxfhglAldZ8Efx0CS6VT824jto00MuInKgHE9e5xmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:54:31.108757Z"},"content_sha256":"247111c00f809a9b317ddbfe10bde2503a2e61bae8f84aa27ad4244e17cf436c","schema_version":"1.0","event_id":"sha256:247111c00f809a9b317ddbfe10bde2503a2e61bae8f84aa27ad4244e17cf436c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU/bundle.json","state_url":"https://pith.science/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU/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-31T09:54:31Z","links":{"resolver":"https://pith.science/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU","bundle":"https://pith.science/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU/bundle.json","state":"https://pith.science/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AL3IPAM2NTWWH3KXEC5LPUK5QU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:AL3IPAM2NTWWH3KXEC5LPUK5QU","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":"26cc0c69dcf79ae43376f18644c29115275ef7b440de352e2d1c82fc677a0c97","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-08T21:23:37Z","title_canon_sha256":"264b98a11de33f59180e194f7417e0c71aa8dd7d566bb8428b9d38b9778ab227"},"schema_version":"1.0","source":{"id":"0901.1140","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.1140","created_at":"2026-05-18T02:15:02Z"},{"alias_kind":"arxiv_version","alias_value":"0901.1140v3","created_at":"2026-05-18T02:15:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.1140","created_at":"2026-05-18T02:15:02Z"},{"alias_kind":"pith_short_12","alias_value":"AL3IPAM2NTWW","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"AL3IPAM2NTWWH3KX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"AL3IPAM2","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:247111c00f809a9b317ddbfe10bde2503a2e61bae8f84aa27ad4244e17cf436c","target":"graph","created_at":"2026-05-18T02:15:02Z","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 \\emph{tollbooth problem}, we are given a tree $\\bT=(V,E)$ with $n$ edges, and a set of $m$ customers, each of whom is interested in purchasing a path on the tree. Each customer has a fixed budget, and the objective is to price the edges of $\\bT$ such that the total revenue made by selling the paths to the customers that can afford them is maximized. An important special case of this problem, known as the \\emph{highway problem}, is when $\\bT$ is restricted to be a line.\n  For the tollbooth problem, we present a randomized $O(\\log n)$-approximation, improving on the current best $O(\\log m","authors_text":"Khaled Elbassioni, Rajiv Raman, Rene Sitters, Saurabh Ray","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-08T21:23:37Z","title":"On Profit-Maximizing Pricing for the Highway and Tollbooth Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.1140","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:fb35a6f13147d1cc9341a355a04fb46cc5bd77a574dafb691969722e1b9ce2d0","target":"record","created_at":"2026-05-18T02:15:02Z","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":"26cc0c69dcf79ae43376f18644c29115275ef7b440de352e2d1c82fc677a0c97","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-01-08T21:23:37Z","title_canon_sha256":"264b98a11de33f59180e194f7417e0c71aa8dd7d566bb8428b9d38b9778ab227"},"schema_version":"1.0","source":{"id":"0901.1140","kind":"arxiv","version":3}},"canonical_sha256":"02f687819a6ced63ed5720bab7d15d853c4e383a3599dd74a943e214c6112693","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02f687819a6ced63ed5720bab7d15d853c4e383a3599dd74a943e214c6112693","first_computed_at":"2026-05-18T02:15:02.854472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:15:02.854472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n6t7H+/p8bq+88R/ixn7PM+QunrslO3qU5sQDmP7sxNhEMPELtfKB5U2qVfZtrNiF6pkuHYior887xd8cgG4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:15:02.854894Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.1140","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb35a6f13147d1cc9341a355a04fb46cc5bd77a574dafb691969722e1b9ce2d0","sha256:247111c00f809a9b317ddbfe10bde2503a2e61bae8f84aa27ad4244e17cf436c"],"state_sha256":"dde8466ad8d26b725edc402bb796a2a70a3fce6cbfe0ce513d75556b21020b02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARVEQIzxe4gUDOk5XcEKex7GMhLurBo77bMU/I/a9ZfTktDJUCoh+HVo+B+ZKTklxFlS/C8VLhkBpdyYiwzOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:54:31.112141Z","bundle_sha256":"f4afb995aef42375b238f1e823c203a19ade3e5b9735018c59209adc73c57886"}}