{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:F3NHN3K3HDNYIYHCQED6TTWA3E","short_pith_number":"pith:F3NHN3K3","schema_version":"1.0","canonical_sha256":"2eda76ed5b38db8460e28107e9cec0d91446c11bbef1a52d1ad11ec87eaec5c0","source":{"kind":"arxiv","id":"2607.28575","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Structured Elections under Thiele Voting Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Alexandra Lassota, Krzysztof Sornat","submitted_at":"2026-07-30T17:37:14Z","abstract_excerpt":"We study the computational complexity of winner determination problems in approval-based committee elections under Thiele voting rules. These form a class of rules parameterized by a fixed weight vector that specifies how a voter's satisfaction depends on the number of approved candidates elected. We first analyze the structure of optimal solutions based on the sets of voters who approve each candidate---that is, how voters' approval ballots induce dependencies between candidates---revealing constraints on a winning committee under any fixed Thiele voting rule. Using this, we design FPT algori"},"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":"2607.28575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-07-30T17:37:14Z","cross_cats_sorted":["cs.AI","cs.DS","cs.MA"],"title_canon_sha256":"74d07505cf70078995afaca0c450aeddfbe7bec2b17b97c40982e55bb97ad441","abstract_canon_sha256":"077dc762c251e5b412df11cb042252854db574cbc388e0f80169d73ea0256dfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eda76ed5b38db8460e28107e9cec0d91446c11bbef1a52d1ad11ec87eaec5c0","last_reissued_at":"2026-07-31T01:38:35.558897Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:38:35.558897Z"},"graph_snapshot":{"paper":{"title":"Algorithms for Structured Elections under Thiele Voting Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS","cs.MA"],"primary_cat":"cs.GT","authors_text":"Alexandra Lassota, Krzysztof Sornat","submitted_at":"2026-07-30T17:37:14Z","abstract_excerpt":"We study the computational complexity of winner determination problems in approval-based committee elections under Thiele voting rules. These form a class of rules parameterized by a fixed weight vector that specifies how a voter's satisfaction depends on the number of approved candidates elected. We first analyze the structure of optimal solutions based on the sets of voters who approve each candidate---that is, how voters' approval ballots induce dependencies between candidates---revealing constraints on a winning committee under any fixed Thiele voting rule. Using this, we design FPT algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28575","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.28575/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.28575","created_at":"2026-07-31T01:38:35.562108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28575v1","created_at":"2026-07-31T01:38:35.562108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28575","created_at":"2026-07-31T01:38:35.562108+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3NHN3K3HDNY","created_at":"2026-07-31T01:38:35.562108+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3NHN3K3HDNYIYHC","created_at":"2026-07-31T01:38:35.562108+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3NHN3K3","created_at":"2026-07-31T01:38:35.562108+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/F3NHN3K3HDNYIYHCQED6TTWA3E","json":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E.json","graph_json":"https://pith.science/api/pith-number/F3NHN3K3HDNYIYHCQED6TTWA3E/graph.json","events_json":"https://pith.science/api/pith-number/F3NHN3K3HDNYIYHCQED6TTWA3E/events.json","paper":"https://pith.science/paper/F3NHN3K3"},"agent_actions":{"view_html":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E","download_json":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E.json","view_paper":"https://pith.science/paper/F3NHN3K3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28575&json=true","fetch_graph":"https://pith.science/api/pith-number/F3NHN3K3HDNYIYHCQED6TTWA3E/graph.json","fetch_events":"https://pith.science/api/pith-number/F3NHN3K3HDNYIYHCQED6TTWA3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E/action/storage_attestation","attest_author":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E/action/author_attestation","sign_citation":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E/action/citation_signature","submit_replication":"https://pith.science/pith/F3NHN3K3HDNYIYHCQED6TTWA3E/action/replication_record"}},"created_at":"2026-07-31T01:38:35.562108+00:00","updated_at":"2026-07-31T01:38:35.562108+00:00"}