{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Z2TJYX4XLCN7PXV7KM62WEWT3V","short_pith_number":"pith:Z2TJYX4X","schema_version":"1.0","canonical_sha256":"cea69c5f97589bf7debf533dab12d3dd66eb7867b112aecf6a70687e4c6fe279","source":{"kind":"arxiv","id":"1504.06475","version":4},"attestation_state":"computed","paper":{"title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raphael Reitzig, Sebastian Wild","submitted_at":"2015-04-24T11:37:00Z","abstract_excerpt":"Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries.\n  In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein (ISAAC, 2014) has worst-case optimal running time but is complex, while the other (Pukelsheim, 2014) is relatively simple and fast in practice but does not offer worst-case guarantees.\n  We demonstrate that the former algorithm is much slower than the other in practice and propose a novel algorithm t"},"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":"1504.06475","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-24T11:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"a7b5065a612e557d4fde994450f0792db7f83f65f553a3f3a2db07ba2eb392a9","abstract_canon_sha256":"61d1f56d850bdd69dc8df734b0f6f89cb44f210a6c86fd4ad3490e337038e6ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:57.283395Z","signature_b64":"lKfMPb06iPjZ5O3adid7IIuqVhfSYdDLKcuaSuc8RYccOwllY9XSwDrekxv1defNclBYyeyMC+ZVBNsfh3dABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea69c5f97589bf7debf533dab12d3dd66eb7867b112aecf6a70687e4c6fe279","last_reissued_at":"2026-05-18T00:28:57.282744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:57.282744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Raphael Reitzig, Sebastian Wild","submitted_at":"2015-04-24T11:37:00Z","abstract_excerpt":"Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries.\n  In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein (ISAAC, 2014) has worst-case optimal running time but is complex, while the other (Pukelsheim, 2014) is relatively simple and fast in practice but does not offer worst-case guarantees.\n  We demonstrate that the former algorithm is much slower than the other in practice and propose a novel algorithm t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06475","kind":"arxiv","version":4},"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":"1504.06475","created_at":"2026-05-18T00:28:57.282847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06475v4","created_at":"2026-05-18T00:28:57.282847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06475","created_at":"2026-05-18T00:28:57.282847+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2TJYX4XLCN7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2TJYX4XLCN7PXV7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2TJYX4X","created_at":"2026-05-18T12:29:52.810259+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/Z2TJYX4XLCN7PXV7KM62WEWT3V","json":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V.json","graph_json":"https://pith.science/api/pith-number/Z2TJYX4XLCN7PXV7KM62WEWT3V/graph.json","events_json":"https://pith.science/api/pith-number/Z2TJYX4XLCN7PXV7KM62WEWT3V/events.json","paper":"https://pith.science/paper/Z2TJYX4X"},"agent_actions":{"view_html":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V","download_json":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V.json","view_paper":"https://pith.science/paper/Z2TJYX4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06475&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2TJYX4XLCN7PXV7KM62WEWT3V/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2TJYX4XLCN7PXV7KM62WEWT3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V/action/storage_attestation","attest_author":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V/action/author_attestation","sign_citation":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V/action/citation_signature","submit_replication":"https://pith.science/pith/Z2TJYX4XLCN7PXV7KM62WEWT3V/action/replication_record"}},"created_at":"2026-05-18T00:28:57.282847+00:00","updated_at":"2026-05-18T00:28:57.282847+00:00"}