{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AVBK33KRRGDWXC5BAZIJZ2BVSX","short_pith_number":"pith:AVBK33KR","schema_version":"1.0","canonical_sha256":"0542aded5189876b8ba106509ce83595c239872749d94b75a6bbe266aef99b2b","source":{"kind":"arxiv","id":"1801.03698","version":1},"attestation_state":"computed","paper":{"title":"On a Stackelberg Subset Sum Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andrea Pacifici, Gaia Nicosia, Ulrich Pferschy","submitted_at":"2018-01-11T10:31:31Z","abstract_excerpt":"This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\\subset N$, and a second player, the follower, selects a solution $A\\subseteq N$ in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff from those items of its subset $L$ that were included in the overall solution $A$, chosen by the follower. We assume that the fol"},"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":"1801.03698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-11T10:31:31Z","cross_cats_sorted":[],"title_canon_sha256":"b81498a3117172b76460f51e15f5e3daae0d8333f60b42104c92c453fc2e030a","abstract_canon_sha256":"78051d5aa14e24eb47e011e4c2c8d5188a110bf7dd00e81d6cd1c90846cb795c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:13.675205Z","signature_b64":"o5tWFN68AiYv7CuEaGEL0tgruGKt/yFiPpCezk1Cn7MnGlLOcNdKvUW4cfeP0cjY7rfsPnXAYefCpzFXR8jcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0542aded5189876b8ba106509ce83595c239872749d94b75a6bbe266aef99b2b","last_reissued_at":"2026-05-18T00:26:13.674690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:13.674690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Stackelberg Subset Sum Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andrea Pacifici, Gaia Nicosia, Ulrich Pferschy","submitted_at":"2018-01-11T10:31:31Z","abstract_excerpt":"This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\\subset N$, and a second player, the follower, selects a solution $A\\subseteq N$ in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff from those items of its subset $L$ that were included in the overall solution $A$, chosen by the follower. We assume that the fol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03698","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":"1801.03698","created_at":"2026-05-18T00:26:13.674772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03698v1","created_at":"2026-05-18T00:26:13.674772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03698","created_at":"2026-05-18T00:26:13.674772+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVBK33KRRGDW","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVBK33KRRGDWXC5B","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVBK33KR","created_at":"2026-05-18T12:32:13.499390+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/AVBK33KRRGDWXC5BAZIJZ2BVSX","json":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX.json","graph_json":"https://pith.science/api/pith-number/AVBK33KRRGDWXC5BAZIJZ2BVSX/graph.json","events_json":"https://pith.science/api/pith-number/AVBK33KRRGDWXC5BAZIJZ2BVSX/events.json","paper":"https://pith.science/paper/AVBK33KR"},"agent_actions":{"view_html":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX","download_json":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX.json","view_paper":"https://pith.science/paper/AVBK33KR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03698&json=true","fetch_graph":"https://pith.science/api/pith-number/AVBK33KRRGDWXC5BAZIJZ2BVSX/graph.json","fetch_events":"https://pith.science/api/pith-number/AVBK33KRRGDWXC5BAZIJZ2BVSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX/action/storage_attestation","attest_author":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX/action/author_attestation","sign_citation":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX/action/citation_signature","submit_replication":"https://pith.science/pith/AVBK33KRRGDWXC5BAZIJZ2BVSX/action/replication_record"}},"created_at":"2026-05-18T00:26:13.674772+00:00","updated_at":"2026-05-18T00:26:13.674772+00:00"}