{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:GXVCX5HTZDAEW5ROAGLGZUW7LQ","short_pith_number":"pith:GXVCX5HT","schema_version":"1.0","canonical_sha256":"35ea2bf4f3c8c04b762e01966cd2df5c39a95b6e3f98a762b94f9f9dac398c96","source":{"kind":"arxiv","id":"0812.0320","version":1},"attestation_state":"computed","paper":{"title":"Stackelberg Network Pricing is Hard to Approximate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret","submitted_at":"2008-12-01T16:15:58Z","abstract_excerpt":"In the Stackelberg Network Pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path once the tariffs are fixed. Roch, Savard, and Marcotte (Networks, Vol. 46(1), 57-67, 2005) proved that this problem is NP-hard, and gave an O(log m)-approximation algorithm, where m denote the number of arcs to be priced. In this note, we show that the problem is also APX-hard."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0812.0320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-01T16:15:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"d9659efe93bb7537e75de10354df8384d1a8dad8b7b99dea46a94a8e5610f2c5","abstract_canon_sha256":"ea98cc6e8d2bb16535b30e280aa14071279040c82f06e6ca9f9b6e5c6f78aed1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:27.240613Z","signature_b64":"NhpjjlRWJLwAxuvuhGH5kFByx9nWeSQWDZBoEry3sJPcSO58PQzz7vwlSaQUrTqnvzmZ8gK05p1qEXw6e+pbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35ea2bf4f3c8c04b762e01966cd2df5c39a95b6e3f98a762b94f9f9dac398c96","last_reissued_at":"2026-05-18T04:27:27.240161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:27.240161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stackelberg Network Pricing is Hard to Approximate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Gwena\\\"el Joret","submitted_at":"2008-12-01T16:15:58Z","abstract_excerpt":"In the Stackelberg Network Pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path once the tariffs are fixed. Roch, Savard, and Marcotte (Networks, Vol. 46(1), 57-67, 2005) proved that this problem is NP-hard, and gave an O(log m)-approximation algorithm, where m denote the number of arcs to be priced. In this note, we show that the problem is also APX-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.0320","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0812.0320","created_at":"2026-05-18T04:27:27.240237+00:00"},{"alias_kind":"arxiv_version","alias_value":"0812.0320v1","created_at":"2026-05-18T04:27:27.240237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.0320","created_at":"2026-05-18T04:27:27.240237+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXVCX5HTZDAE","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXVCX5HTZDAEW5RO","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXVCX5HT","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ","json":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ.json","graph_json":"https://pith.science/api/pith-number/GXVCX5HTZDAEW5ROAGLGZUW7LQ/graph.json","events_json":"https://pith.science/api/pith-number/GXVCX5HTZDAEW5ROAGLGZUW7LQ/events.json","paper":"https://pith.science/paper/GXVCX5HT"},"agent_actions":{"view_html":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ","download_json":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ.json","view_paper":"https://pith.science/paper/GXVCX5HT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0812.0320&json=true","fetch_graph":"https://pith.science/api/pith-number/GXVCX5HTZDAEW5ROAGLGZUW7LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GXVCX5HTZDAEW5ROAGLGZUW7LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/action/storage_attestation","attest_author":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/action/author_attestation","sign_citation":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/action/citation_signature","submit_replication":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/action/replication_record"}},"created_at":"2026-05-18T04:27:27.240237+00:00","updated_at":"2026-05-18T04:27:27.240237+00:00"}