{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ERR73CGRCHBGG36RXHNBKGRXJD","short_pith_number":"pith:ERR73CGR","schema_version":"1.0","canonical_sha256":"2463fd88d111c2636fd1b9da151a3748ed631146d0712552712266258a1d2fb3","source":{"kind":"arxiv","id":"1207.2317","version":1},"attestation_state":"computed","paper":{"title":"Stackelberg Shortest Path Tree Game, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Sergio Cabello","submitted_at":"2012-07-10T11:49:11Z","abstract_excerpt":"Let $G(V,E)$ be a directed graph with $n$ vertices and $m$ edges. The edges $E$ of $G$ are divided into two types: $E_F$ and $E_P$. Each edge of $E_F$ has a fixed price. The edges of $E_P$ are the priceable edges and their price is not fixed a priori. Let $r$ be a vertex of $G$. For an assignment of prices to the edges of $E_P$, the revenue is given by the following procedure: select a shortest path tree $T$ from $r$ with respect to the prices (a tree of cheapest paths); the revenue is the sum, over all priceable edges $e$, of the product of the price of $e$ and the number of vertices below $e"},"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":"1207.2317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-10T11:49:11Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"c298805f514f53d8d3e9fbb0a2d5e24c093b8e7d08ad7fbcbe08d8e49b37440e","abstract_canon_sha256":"b3c0986617e272c0564d9baef69bf5159c6ae0e1c46c3c38efbc4db8327e3a77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:24.430871Z","signature_b64":"B7aFn5+yTVlHeiJ3/c/Txl6Kh0mYE0RELwVe+yzfnyJTfqFdFRQpA1KbhRhsHm48VOUoaLXAkjIZzi6hlNjRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2463fd88d111c2636fd1b9da151a3748ed631146d0712552712266258a1d2fb3","last_reissued_at":"2026-05-18T03:51:24.430412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:24.430412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stackelberg Shortest Path Tree Game, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Sergio Cabello","submitted_at":"2012-07-10T11:49:11Z","abstract_excerpt":"Let $G(V,E)$ be a directed graph with $n$ vertices and $m$ edges. The edges $E$ of $G$ are divided into two types: $E_F$ and $E_P$. Each edge of $E_F$ has a fixed price. The edges of $E_P$ are the priceable edges and their price is not fixed a priori. Let $r$ be a vertex of $G$. For an assignment of prices to the edges of $E_P$, the revenue is given by the following procedure: select a shortest path tree $T$ from $r$ with respect to the prices (a tree of cheapest paths); the revenue is the sum, over all priceable edges $e$, of the product of the price of $e$ and the number of vertices below $e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2317","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":"1207.2317","created_at":"2026-05-18T03:51:24.430484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2317v1","created_at":"2026-05-18T03:51:24.430484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2317","created_at":"2026-05-18T03:51:24.430484+00:00"},{"alias_kind":"pith_short_12","alias_value":"ERR73CGRCHBG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"ERR73CGRCHBGG36R","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"ERR73CGR","created_at":"2026-05-18T12:27:04.183437+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/ERR73CGRCHBGG36RXHNBKGRXJD","json":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD.json","graph_json":"https://pith.science/api/pith-number/ERR73CGRCHBGG36RXHNBKGRXJD/graph.json","events_json":"https://pith.science/api/pith-number/ERR73CGRCHBGG36RXHNBKGRXJD/events.json","paper":"https://pith.science/paper/ERR73CGR"},"agent_actions":{"view_html":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD","download_json":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD.json","view_paper":"https://pith.science/paper/ERR73CGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2317&json=true","fetch_graph":"https://pith.science/api/pith-number/ERR73CGRCHBGG36RXHNBKGRXJD/graph.json","fetch_events":"https://pith.science/api/pith-number/ERR73CGRCHBGG36RXHNBKGRXJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD/action/storage_attestation","attest_author":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD/action/author_attestation","sign_citation":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD/action/citation_signature","submit_replication":"https://pith.science/pith/ERR73CGRCHBGG36RXHNBKGRXJD/action/replication_record"}},"created_at":"2026-05-18T03:51:24.430484+00:00","updated_at":"2026-05-18T03:51:24.430484+00:00"}