{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5EK4I2TSJINXEIG3DPWALFNUZW","short_pith_number":"pith:5EK4I2TS","schema_version":"1.0","canonical_sha256":"e915c46a724a1b7220db1bec0595b4cdb31bb6d4ba7227e17be534ea6737a562","source":{"kind":"arxiv","id":"1703.10415","version":1},"attestation_state":"computed","paper":{"title":"A Polynomial-time Algorithm to Achieve Extended Justified Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Shenwei Huang","submitted_at":"2017-03-30T11:25:13Z","abstract_excerpt":"We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In particular we focus on the axiomatic property called extended justified representation (EJR). Although a committee satisfying EJR is guaranteed to exist, the computational complexity of finding such a committee has been an open problem and explicitly mentioned in multiple recent papers. We settle the complexity of finding a committee satisfying EJR by presenting a polynomial-time algorithm for the problem. Our algorithmic"},"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":"1703.10415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-30T11:25:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6b48def998015752e47e8a5e89de5deaa15b15259eaff3a1c17ab09b68683fde","abstract_canon_sha256":"8b0e07d166fcc28d72057ff4df45b3b1a80618c7aacb5cc8f21d7399ae53f186"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:34.754530Z","signature_b64":"BlJPhcaQXP2eX7Xbp9nPuNvRd+wDWSxanQjLJmywMOlcuqRmBGb47gIQfT/pVacTgy4QswkOuqrW4PR3IkgxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e915c46a724a1b7220db1bec0595b4cdb31bb6d4ba7227e17be534ea6737a562","last_reissued_at":"2026-05-18T00:47:34.753931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:34.753931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Polynomial-time Algorithm to Achieve Extended Justified Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Haris Aziz, Shenwei Huang","submitted_at":"2017-03-30T11:25:13Z","abstract_excerpt":"We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In particular we focus on the axiomatic property called extended justified representation (EJR). Although a committee satisfying EJR is guaranteed to exist, the computational complexity of finding such a committee has been an open problem and explicitly mentioned in multiple recent papers. We settle the complexity of finding a committee satisfying EJR by presenting a polynomial-time algorithm for the problem. Our algorithmic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10415","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":"1703.10415","created_at":"2026-05-18T00:47:34.754000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10415v1","created_at":"2026-05-18T00:47:34.754000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10415","created_at":"2026-05-18T00:47:34.754000+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EK4I2TSJINX","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EK4I2TSJINXEIG3","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EK4I2TS","created_at":"2026-05-18T12:31:00.734936+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/5EK4I2TSJINXEIG3DPWALFNUZW","json":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW.json","graph_json":"https://pith.science/api/pith-number/5EK4I2TSJINXEIG3DPWALFNUZW/graph.json","events_json":"https://pith.science/api/pith-number/5EK4I2TSJINXEIG3DPWALFNUZW/events.json","paper":"https://pith.science/paper/5EK4I2TS"},"agent_actions":{"view_html":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW","download_json":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW.json","view_paper":"https://pith.science/paper/5EK4I2TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10415&json=true","fetch_graph":"https://pith.science/api/pith-number/5EK4I2TSJINXEIG3DPWALFNUZW/graph.json","fetch_events":"https://pith.science/api/pith-number/5EK4I2TSJINXEIG3DPWALFNUZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW/action/storage_attestation","attest_author":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW/action/author_attestation","sign_citation":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW/action/citation_signature","submit_replication":"https://pith.science/pith/5EK4I2TSJINXEIG3DPWALFNUZW/action/replication_record"}},"created_at":"2026-05-18T00:47:34.754000+00:00","updated_at":"2026-05-18T00:47:34.754000+00:00"}