{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NPOQUHHT5QLWL2YQZUIAYG6GKH","short_pith_number":"pith:NPOQUHHT","schema_version":"1.0","canonical_sha256":"6bdd0a1cf3ec1765eb10cd100c1bc651f3fb35a2167e2329628dbacbf8006d97","source":{"kind":"arxiv","id":"1407.1167","version":1},"attestation_state":"computed","paper":{"title":"Specializations and Generalizations of 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":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2014-07-04T09:36:32Z","abstract_excerpt":"Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \\emph{red} edges and a set $B$ of \\emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \\emph{Stackelberg Minimum Spanning Tree} (\\stack) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. \\stack \\ is known to be \\apx-hard already when the number of distinct red weights is 2. In this paper we analyze some meaningful specializations and "},"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":"1407.1167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-04T09:36:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a85a8d458251799f7a01c3b5ff6aaad8b6846ce3b15b1c06ba6e190594001552","abstract_canon_sha256":"baac623f8e64cd6d8b14badb1acb229f62836bdf5b2b833f1c1ef23ae0150dab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:18.564625Z","signature_b64":"BZ+esaNhX3r8cdLAjnnRCH4zU5jZhWxixsmypkGcLfgSkpDCNzS9MaFBJ/hb+Uv0UfHo2ZQ5dNacWWcu45HtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bdd0a1cf3ec1765eb10cd100c1bc651f3fb35a2167e2329628dbacbf8006d97","last_reissued_at":"2026-05-18T02:48:18.564161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:18.564161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Specializations and Generalizations of 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":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","submitted_at":"2014-07-04T09:36:32Z","abstract_excerpt":"Let be given a graph $G=(V,E)$ whose edge set is partitioned into a set $R$ of \\emph{red} edges and a set $B$ of \\emph{blue} edges, and assume that red edges are weighted and form a spanning tree of $G$. Then, the \\emph{Stackelberg Minimum Spanning Tree} (\\stack) problem is that of pricing (i.e., weighting) the blue edges in such a way that the total weight of the blue edges selected in a minimum spanning tree of the resulting graph is maximized. \\stack \\ is known to be \\apx-hard already when the number of distinct red weights is 2. In this paper we analyze some meaningful specializations and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1167","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":"1407.1167","created_at":"2026-05-18T02:48:18.564223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1167v1","created_at":"2026-05-18T02:48:18.564223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1167","created_at":"2026-05-18T02:48:18.564223+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPOQUHHT5QLW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPOQUHHT5QLWL2YQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPOQUHHT","created_at":"2026-05-18T12:28:41.024544+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/NPOQUHHT5QLWL2YQZUIAYG6GKH","json":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH.json","graph_json":"https://pith.science/api/pith-number/NPOQUHHT5QLWL2YQZUIAYG6GKH/graph.json","events_json":"https://pith.science/api/pith-number/NPOQUHHT5QLWL2YQZUIAYG6GKH/events.json","paper":"https://pith.science/paper/NPOQUHHT"},"agent_actions":{"view_html":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH","download_json":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH.json","view_paper":"https://pith.science/paper/NPOQUHHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1167&json=true","fetch_graph":"https://pith.science/api/pith-number/NPOQUHHT5QLWL2YQZUIAYG6GKH/graph.json","fetch_events":"https://pith.science/api/pith-number/NPOQUHHT5QLWL2YQZUIAYG6GKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/action/storage_attestation","attest_author":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/action/author_attestation","sign_citation":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/action/citation_signature","submit_replication":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/action/replication_record"}},"created_at":"2026-05-18T02:48:18.564223+00:00","updated_at":"2026-05-18T02:48:18.564223+00:00"}