{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EGM7ZPQU3C6JDUIDBUOSR6NFDE","short_pith_number":"pith:EGM7ZPQU","schema_version":"1.0","canonical_sha256":"2199fcbe14d8bc91d1030d1d28f9a5193fed11e86f6ce73aed385cbd4bea5e75","source":{"kind":"arxiv","id":"1711.04520","version":2},"attestation_state":"computed","paper":{"title":"Fair Knapsack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Kai Wilker, Mervin Triphaus, Piotr Skowron, Till Fluschnik","submitted_at":"2017-11-13T11:00:21Z","abstract_excerpt":"We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to select a subset of items with the total cost not exceeding the budget, in a way that is consistent with the voters' preferences. Since the preferences of the voters over the items can vary significantly, we need a way of aggregating these preferences, in order to select the socially best valid knapsack. We study three approaches to aggregating voters' prefe"},"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":"1711.04520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-13T11:00:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f3ae6a2d2c3433d8b72bf18c502c3aa3cd50609e2660859f894351cde5dfc78","abstract_canon_sha256":"4229dbf472082b332cc61ef1b004c9eb24c7c960eb1319f4330eeb080bc70048"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.959509Z","signature_b64":"zF2Txl5GQMn0DHdxSkT9aZr68hXUdh6K9BYFVqUmXRGDCRAqHYUMGRWGYdb39oQdppIMiif/ACEuWR4PAgXPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2199fcbe14d8bc91d1030d1d28f9a5193fed11e86f6ce73aed385cbd4bea5e75","last_reissued_at":"2026-05-18T00:01:01.959065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.959065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Knapsack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Kai Wilker, Mervin Triphaus, Piotr Skowron, Till Fluschnik","submitted_at":"2017-11-13T11:00:21Z","abstract_excerpt":"We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to select a subset of items with the total cost not exceeding the budget, in a way that is consistent with the voters' preferences. Since the preferences of the voters over the items can vary significantly, we need a way of aggregating these preferences, in order to select the socially best valid knapsack. We study three approaches to aggregating voters' prefe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04520","kind":"arxiv","version":2},"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":"1711.04520","created_at":"2026-05-18T00:01:01.959132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04520v2","created_at":"2026-05-18T00:01:01.959132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04520","created_at":"2026-05-18T00:01:01.959132+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGM7ZPQU3C6J","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGM7ZPQU3C6JDUID","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGM7ZPQU","created_at":"2026-05-18T12:31:12.930513+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/EGM7ZPQU3C6JDUIDBUOSR6NFDE","json":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE.json","graph_json":"https://pith.science/api/pith-number/EGM7ZPQU3C6JDUIDBUOSR6NFDE/graph.json","events_json":"https://pith.science/api/pith-number/EGM7ZPQU3C6JDUIDBUOSR6NFDE/events.json","paper":"https://pith.science/paper/EGM7ZPQU"},"agent_actions":{"view_html":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE","download_json":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE.json","view_paper":"https://pith.science/paper/EGM7ZPQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04520&json=true","fetch_graph":"https://pith.science/api/pith-number/EGM7ZPQU3C6JDUIDBUOSR6NFDE/graph.json","fetch_events":"https://pith.science/api/pith-number/EGM7ZPQU3C6JDUIDBUOSR6NFDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE/action/storage_attestation","attest_author":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE/action/author_attestation","sign_citation":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE/action/citation_signature","submit_replication":"https://pith.science/pith/EGM7ZPQU3C6JDUIDBUOSR6NFDE/action/replication_record"}},"created_at":"2026-05-18T00:01:01.959132+00:00","updated_at":"2026-05-18T00:01:01.959132+00:00"}