{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:7CJI2R3WC5K7ZHTDPO3A7DY3IT","short_pith_number":"pith:7CJI2R3W","schema_version":"1.0","canonical_sha256":"f8928d47761755fc9e637bb60f8f1b44fb4cab3100d8e3e7170b378127625451","source":{"kind":"arxiv","id":"cs/0703019","version":3},"attestation_state":"computed","paper":{"title":"The Stackelberg Minimum Spanning Tree Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Erik D. Demaine, Gwena\\\"el Joret, Ilan Newman, Jean Cardinal, Oren Weimann, Samuel Fiorini, Stefan Langerman","submitted_at":"2007-03-05T09:46:26Z","abstract_excerpt":"We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning Tree game or StackMST.\n  The game is played on a graph (representing a network), whose edges are colored either red or blue, and where the red edges have a given fixed cost (representing the competitor's prices). The first player chooses an assignment of prices to the blue edges, and the second player then buys the cheapest possible minimum spanning tree, using any combination of red and blue edges. The goal of the first player is to maximize the total price of purchased blue edges. This game is the minim"},"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":"cs/0703019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2007-03-05T09:46:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"47f926ad5ca1312f25d1e00548607c809f25beedadd160c150366a8aeadcffbb","abstract_canon_sha256":"fc05fc826c28fa3eb513410770874700ce4cdb4eb1c618e5530f2bbde589509a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:25.876212Z","signature_b64":"AyJWGuaOje19/8WBOwlQcxqm1BUPJotmg+oY4NH/BNBJWJJSGMrDZEOhphbkKIu4JLA6NoGgLNB083Z5UwZBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8928d47761755fc9e637bb60f8f1b44fb4cab3100d8e3e7170b378127625451","last_reissued_at":"2026-05-18T04:27:25.875749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:25.875749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stackelberg Minimum Spanning Tree Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Erik D. Demaine, Gwena\\\"el Joret, Ilan Newman, Jean Cardinal, Oren Weimann, Samuel Fiorini, Stefan Langerman","submitted_at":"2007-03-05T09:46:26Z","abstract_excerpt":"We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning Tree game or StackMST.\n  The game is played on a graph (representing a network), whose edges are colored either red or blue, and where the red edges have a given fixed cost (representing the competitor's prices). The first player chooses an assignment of prices to the blue edges, and the second player then buys the cheapest possible minimum spanning tree, using any combination of red and blue edges. The goal of the first player is to maximize the total price of purchased blue edges. This game is the minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0703019","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0703019","created_at":"2026-05-18T04:27:25.875808+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0703019v3","created_at":"2026-05-18T04:27:25.875808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0703019","created_at":"2026-05-18T04:27:25.875808+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CJI2R3WC5K7","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CJI2R3WC5K7ZHTD","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CJI2R3W","created_at":"2026-05-18T12:25:55.427421+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/7CJI2R3WC5K7ZHTDPO3A7DY3IT","json":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT.json","graph_json":"https://pith.science/api/pith-number/7CJI2R3WC5K7ZHTDPO3A7DY3IT/graph.json","events_json":"https://pith.science/api/pith-number/7CJI2R3WC5K7ZHTDPO3A7DY3IT/events.json","paper":"https://pith.science/paper/7CJI2R3W"},"agent_actions":{"view_html":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT","download_json":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT.json","view_paper":"https://pith.science/paper/7CJI2R3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0703019&json=true","fetch_graph":"https://pith.science/api/pith-number/7CJI2R3WC5K7ZHTDPO3A7DY3IT/graph.json","fetch_events":"https://pith.science/api/pith-number/7CJI2R3WC5K7ZHTDPO3A7DY3IT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT/action/storage_attestation","attest_author":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT/action/author_attestation","sign_citation":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT/action/citation_signature","submit_replication":"https://pith.science/pith/7CJI2R3WC5K7ZHTDPO3A7DY3IT/action/replication_record"}},"created_at":"2026-05-18T04:27:25.875808+00:00","updated_at":"2026-05-18T04:27:25.875808+00:00"}