{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PB33PHHIIEK6JMGUGPW4RJCXKP","short_pith_number":"pith:PB33PHHI","canonical_record":{"source":{"id":"1707.09225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-28T13:34:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e61ffcb15219e4508a02d8bf0b5a6658cfb6b250b2c501a99e076e2869f59aba","abstract_canon_sha256":"e36d00124b51b962f2e4497e7204d34c19192088390e8d87aee8c59ebef16fdd"},"schema_version":"1.0"},"canonical_sha256":"7877b79ce84115e4b0d433edc8a45753d5896b72da898c0ae24db09ebe73c514","source":{"kind":"arxiv","id":"1707.09225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09225","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09225v1","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09225","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"PB33PHHIIEK6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PB33PHHIIEK6JMGU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PB33PHHI","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PB33PHHIIEK6JMGUGPW4RJCXKP","target":"record","payload":{"canonical_record":{"source":{"id":"1707.09225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-28T13:34:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e61ffcb15219e4508a02d8bf0b5a6658cfb6b250b2c501a99e076e2869f59aba","abstract_canon_sha256":"e36d00124b51b962f2e4497e7204d34c19192088390e8d87aee8c59ebef16fdd"},"schema_version":"1.0"},"canonical_sha256":"7877b79ce84115e4b0d433edc8a45753d5896b72da898c0ae24db09ebe73c514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:16.736587Z","signature_b64":"hg+hYgCRCrop4SYSJmM5YAYdlErx5FcLRpkq9z3M3XvktN5Oujc80hhhvt6D2bKCvWIBdguzeB7+QB4ysLx4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7877b79ce84115e4b0d433edc8a45753d5896b72da898c0ae24db09ebe73c514","last_reissued_at":"2026-05-18T00:39:16.736004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:16.736004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.09225","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-18T00:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aybAivSeF1QtLdHzB0Aqqi1KcFaTttrk7e0gHCiOEzSMagbC9fLJHcal03wQNcjEEJ5r9QjjwVlfIj3iYO0vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:18:11.301035Z"},"content_sha256":"cd58c7372e85cc2039f3e950c2e84449fe8cb1f423bf9f18f8d9f0781af87d57","schema_version":"1.0","event_id":"sha256:cd58c7372e85cc2039f3e950c2e84449fe8cb1f423bf9f18f8d9f0781af87d57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PB33PHHIIEK6JMGUGPW4RJCXKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Andrea Scozzari, Diego Ponce, Federica Ricca, Justo Puerto","submitted_at":"2017-07-28T13:34:23Z","abstract_excerpt":"In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates as she/he likes by expressing a preference profile (boolean $m$-vector). In order to elect a committee, a voting rule must be established to `transform' the $n$ voters' profiles into a winning committee. The problem is widely studied in voting theory; for a variety of voting rules the problem was shown to be computationally difficult and approximation algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09225","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-18T00:39:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fl7P9X5TDHU7eg2jpI6xcaSZaYnkRtkxypb0vZ4HiQM5vDlvVvtSEV8HlSr29PKFEB9W1K1YcUnsJILDevQBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:18:11.301388Z"},"content_sha256":"08b5b4ab37ecd7fd95aafaf0ca65b262dacab25f749aec5d55a20b8ee356b8b4","schema_version":"1.0","event_id":"sha256:08b5b4ab37ecd7fd95aafaf0ca65b262dacab25f749aec5d55a20b8ee356b8b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PB33PHHIIEK6JMGUGPW4RJCXKP/bundle.json","state_url":"https://pith.science/pith/PB33PHHIIEK6JMGUGPW4RJCXKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PB33PHHIIEK6JMGUGPW4RJCXKP/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-24T17:18:11Z","links":{"resolver":"https://pith.science/pith/PB33PHHIIEK6JMGUGPW4RJCXKP","bundle":"https://pith.science/pith/PB33PHHIIEK6JMGUGPW4RJCXKP/bundle.json","state":"https://pith.science/pith/PB33PHHIIEK6JMGUGPW4RJCXKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PB33PHHIIEK6JMGUGPW4RJCXKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PB33PHHIIEK6JMGUGPW4RJCXKP","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":"e36d00124b51b962f2e4497e7204d34c19192088390e8d87aee8c59ebef16fdd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-28T13:34:23Z","title_canon_sha256":"e61ffcb15219e4508a02d8bf0b5a6658cfb6b250b2c501a99e076e2869f59aba"},"schema_version":"1.0","source":{"id":"1707.09225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09225","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09225v1","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09225","created_at":"2026-05-18T00:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"PB33PHHIIEK6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PB33PHHIIEK6JMGU","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PB33PHHI","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:08b5b4ab37ecd7fd95aafaf0ca65b262dacab25f749aec5d55a20b8ee356b8b4","target":"graph","created_at":"2026-05-18T00:39:16Z","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":"In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates as she/he likes by expressing a preference profile (boolean $m$-vector). In order to elect a committee, a voting rule must be established to `transform' the $n$ voters' profiles into a winning committee. The problem is widely studied in voting theory; for a variety of voting rules the problem was shown to be computationally difficult and approximation algor","authors_text":"Andrea Scozzari, Diego Ponce, Federica Ricca, Justo Puerto","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-28T13:34:23Z","title":"Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09225","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:cd58c7372e85cc2039f3e950c2e84449fe8cb1f423bf9f18f8d9f0781af87d57","target":"record","created_at":"2026-05-18T00:39:16Z","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":"e36d00124b51b962f2e4497e7204d34c19192088390e8d87aee8c59ebef16fdd","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-28T13:34:23Z","title_canon_sha256":"e61ffcb15219e4508a02d8bf0b5a6658cfb6b250b2c501a99e076e2869f59aba"},"schema_version":"1.0","source":{"id":"1707.09225","kind":"arxiv","version":1}},"canonical_sha256":"7877b79ce84115e4b0d433edc8a45753d5896b72da898c0ae24db09ebe73c514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7877b79ce84115e4b0d433edc8a45753d5896b72da898c0ae24db09ebe73c514","first_computed_at":"2026-05-18T00:39:16.736004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:16.736004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hg+hYgCRCrop4SYSJmM5YAYdlErx5FcLRpkq9z3M3XvktN5Oujc80hhhvt6D2bKCvWIBdguzeB7+QB4ysLx4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:16.736587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd58c7372e85cc2039f3e950c2e84449fe8cb1f423bf9f18f8d9f0781af87d57","sha256:08b5b4ab37ecd7fd95aafaf0ca65b262dacab25f749aec5d55a20b8ee356b8b4"],"state_sha256":"a0aebd774acdb3269c407c5fd20c4ef2041370244301ec4854088313222e8699"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"42ciDxaka8uEeoEgZiYMtXJB4XLR4o7/CNB/RT18Dv4GQQCUkIh2G2ERRH3/EgrdDWJqu+GrdRreL1IQLBIXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:18:11.303202Z","bundle_sha256":"dd64cf511542ae3c71dffe1117ae7de9025aade51b63227f3f9cfdaa94b555b2"}}