{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GXVCX5HTZDAEW5ROAGLGZUW7LQ","short_pith_number":"pith:GXVCX5HT","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"},"canonical_sha256":"35ea2bf4f3c8c04b762e01966cd2df5c39a95b6e3f98a762b94f9f9dac398c96","source":{"kind":"arxiv","id":"0812.0320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.0320","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"arxiv_version","alias_value":"0812.0320v1","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.0320","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"pith_short_12","alias_value":"GXVCX5HTZDAE","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GXVCX5HTZDAEW5RO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GXVCX5HT","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GXVCX5HTZDAEW5ROAGLGZUW7LQ","target":"record","payload":{"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"},"canonical_sha256":"35ea2bf4f3c8c04b762e01966cd2df5c39a95b6e3f98a762b94f9f9dac398c96","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"},"source_kind":"arxiv","source_id":"0812.0320","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-18T04:27:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rs3DndMUl2lfYXFQJJrn0rQ/yDBnw5vXN+nRFWLCUgJZ/9ldI37qbDyL+AX7ExHtjq1RpfJ7baTPzbzxaHt8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:26:18.684001Z"},"content_sha256":"83a00c15fa71fd42085e60c2d07296e24c9d66c257f1febfdb69e0cbc99e09f4","schema_version":"1.0","event_id":"sha256:83a00c15fa71fd42085e60c2d07296e24c9d66c257f1febfdb69e0cbc99e09f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GXVCX5HTZDAEW5ROAGLGZUW7LQ","target":"graph","payload":{"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"},"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-18T04:27:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jS2cLLk0EngEnlwUaEBZ4Nmcl1nGpcfRl5LqhUCY+db+nN0KIlT4ekIv6XrVSjOgfc08z/ZFrIJJkp3FXHMDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:26:18.684650Z"},"content_sha256":"255ac6f2bf1cb3ade13b4ac463a2c6915b13d317c8841c0514f7a40b5a81ae92","schema_version":"1.0","event_id":"sha256:255ac6f2bf1cb3ade13b4ac463a2c6915b13d317c8841c0514f7a40b5a81ae92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/bundle.json","state_url":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/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-05T21:26:18Z","links":{"resolver":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ","bundle":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/bundle.json","state":"https://pith.science/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXVCX5HTZDAEW5ROAGLGZUW7LQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GXVCX5HTZDAEW5ROAGLGZUW7LQ","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":"ea98cc6e8d2bb16535b30e280aa14071279040c82f06e6ca9f9b6e5c6f78aed1","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-01T16:15:58Z","title_canon_sha256":"d9659efe93bb7537e75de10354df8384d1a8dad8b7b99dea46a94a8e5610f2c5"},"schema_version":"1.0","source":{"id":"0812.0320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0812.0320","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"arxiv_version","alias_value":"0812.0320v1","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0812.0320","created_at":"2026-05-18T04:27:27Z"},{"alias_kind":"pith_short_12","alias_value":"GXVCX5HTZDAE","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GXVCX5HTZDAEW5RO","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GXVCX5HT","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:255ac6f2bf1cb3ade13b4ac463a2c6915b13d317c8841c0514f7a40b5a81ae92","target":"graph","created_at":"2026-05-18T04:27:27Z","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 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.","authors_text":"Gwena\\\"el Joret","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-01T16:15:58Z","title":"Stackelberg Network Pricing is Hard to Approximate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0812.0320","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:83a00c15fa71fd42085e60c2d07296e24c9d66c257f1febfdb69e0cbc99e09f4","target":"record","created_at":"2026-05-18T04:27:27Z","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":"ea98cc6e8d2bb16535b30e280aa14071279040c82f06e6ca9f9b6e5c6f78aed1","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-12-01T16:15:58Z","title_canon_sha256":"d9659efe93bb7537e75de10354df8384d1a8dad8b7b99dea46a94a8e5610f2c5"},"schema_version":"1.0","source":{"id":"0812.0320","kind":"arxiv","version":1}},"canonical_sha256":"35ea2bf4f3c8c04b762e01966cd2df5c39a95b6e3f98a762b94f9f9dac398c96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35ea2bf4f3c8c04b762e01966cd2df5c39a95b6e3f98a762b94f9f9dac398c96","first_computed_at":"2026-05-18T04:27:27.240161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:27.240161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NhpjjlRWJLwAxuvuhGH5kFByx9nWeSQWDZBoEry3sJPcSO58PQzz7vwlSaQUrTqnvzmZ8gK05p1qEXw6e+pbCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:27.240613Z","signed_message":"canonical_sha256_bytes"},"source_id":"0812.0320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83a00c15fa71fd42085e60c2d07296e24c9d66c257f1febfdb69e0cbc99e09f4","sha256:255ac6f2bf1cb3ade13b4ac463a2c6915b13d317c8841c0514f7a40b5a81ae92"],"state_sha256":"cbb6ae82e6db7304c5af96b15149efea1905b7147cdda7b1ae076bec1b01f7bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/0BwC6PbSi0ndO/Q7t35kZ0Sv2jm9LudfuAZ8V5doaUHSrb1R0K27x/FJiWxbpF4TLHo2jGhK/Bl436BUWzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:26:18.688869Z","bundle_sha256":"3754d2cb9b847463ec7d433c67eb218c1fb1666772fa40fcfa345443ecca1fec"}}