{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NPOQUHHT5QLWL2YQZUIAYG6GKH","short_pith_number":"pith:NPOQUHHT","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"},"canonical_sha256":"6bdd0a1cf3ec1765eb10cd100c1bc651f3fb35a2167e2329628dbacbf8006d97","source":{"kind":"arxiv","id":"1407.1167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1167","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1167v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1167","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"NPOQUHHT5QLW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NPOQUHHT5QLWL2YQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NPOQUHHT","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NPOQUHHT5QLWL2YQZUIAYG6GKH","target":"record","payload":{"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"},"canonical_sha256":"6bdd0a1cf3ec1765eb10cd100c1bc651f3fb35a2167e2329628dbacbf8006d97","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"},"source_kind":"arxiv","source_id":"1407.1167","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-18T02:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MB3Lz7muEpfCGw0dJ7fXyuVnIGf85eEUZUKUxxA1v+o0mkvQwMtw5CeJXnOOR4dKzUMUSPWAW8+xZyk5pOyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:45:04.418014Z"},"content_sha256":"b123be076f2005f32de8849cd8d823cda00ba3e7192dafa06fe32a981811c158","schema_version":"1.0","event_id":"sha256:b123be076f2005f32de8849cd8d823cda00ba3e7192dafa06fe32a981811c158"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NPOQUHHT5QLWL2YQZUIAYG6GKH","target":"graph","payload":{"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"},"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-18T02:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYwNyF+c9QSIgywbaJMK7w4fDuz299Oa/jsVDWIKbha/hblVn1fr2HwHE7RPNI8t/tzfwEG8OyU0yVp/H9SqBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:45:04.418683Z"},"content_sha256":"b7c5a372d6c6e36cd459a8f541f7934be633b91e978a1c1f00ba6e210e56c81e","schema_version":"1.0","event_id":"sha256:b7c5a372d6c6e36cd459a8f541f7934be633b91e978a1c1f00ba6e210e56c81e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/bundle.json","state_url":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/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-01T00:45:04Z","links":{"resolver":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH","bundle":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/bundle.json","state":"https://pith.science/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPOQUHHT5QLWL2YQZUIAYG6GKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NPOQUHHT5QLWL2YQZUIAYG6GKH","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":"baac623f8e64cd6d8b14badb1acb229f62836bdf5b2b833f1c1ef23ae0150dab","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-04T09:36:32Z","title_canon_sha256":"a85a8d458251799f7a01c3b5ff6aaad8b6846ce3b15b1c06ba6e190594001552"},"schema_version":"1.0","source":{"id":"1407.1167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1167","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1167v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1167","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"NPOQUHHT5QLW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NPOQUHHT5QLWL2YQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NPOQUHHT","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:b7c5a372d6c6e36cd459a8f541f7934be633b91e978a1c1f00ba6e210e56c81e","target":"graph","created_at":"2026-05-18T02:48:18Z","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":"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 ","authors_text":"Davide Bil\\`o, Guido Proietti, Luciano Gual\\`a, Stefano Leucci","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-04T09:36:32Z","title":"Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1167","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:b123be076f2005f32de8849cd8d823cda00ba3e7192dafa06fe32a981811c158","target":"record","created_at":"2026-05-18T02:48:18Z","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":"baac623f8e64cd6d8b14badb1acb229f62836bdf5b2b833f1c1ef23ae0150dab","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-04T09:36:32Z","title_canon_sha256":"a85a8d458251799f7a01c3b5ff6aaad8b6846ce3b15b1c06ba6e190594001552"},"schema_version":"1.0","source":{"id":"1407.1167","kind":"arxiv","version":1}},"canonical_sha256":"6bdd0a1cf3ec1765eb10cd100c1bc651f3fb35a2167e2329628dbacbf8006d97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bdd0a1cf3ec1765eb10cd100c1bc651f3fb35a2167e2329628dbacbf8006d97","first_computed_at":"2026-05-18T02:48:18.564161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:18.564161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZ+esaNhX3r8cdLAjnnRCH4zU5jZhWxixsmypkGcLfgSkpDCNzS9MaFBJ/hb+Uv0UfHo2ZQ5dNacWWcu45HtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:18.564625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b123be076f2005f32de8849cd8d823cda00ba3e7192dafa06fe32a981811c158","sha256:b7c5a372d6c6e36cd459a8f541f7934be633b91e978a1c1f00ba6e210e56c81e"],"state_sha256":"88badf70debf914c33a8f2625799e459467d3246bc48533274f7fb33e6514677"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2ziT2wKshVAUaZNgrZr5nx2plnBrBg5mL3OTPgjOzfopiZYdVZ3r493cj0bovBRAo5H9mENYG1LuawimKXcDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:45:04.422342Z","bundle_sha256":"77c5f1834b4e6348fa2bbcc1ef8139cab3a3436727771afff036a98686012be2"}}