{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ON2FDW654ET6H5IFTLWJDX7BXB","short_pith_number":"pith:ON2FDW65","canonical_record":{"source":{"id":"1208.1661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T13:29:51Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"104f4267a64b779ff3043eac77f6cbca8ca4ba7d0019c63265aa9a856f56a8de","abstract_canon_sha256":"58fccef09f3926eed3ef62c60f29b14aca8615113a0264ec18f11214eeda6ca6"},"schema_version":"1.0"},"canonical_sha256":"737451dbdde127e3f5059aec91dfe1b8628bcea06f246e7455871eb642979fdf","source":{"kind":"arxiv","id":"1208.1661","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1661","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1661v2","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1661","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"pith_short_12","alias_value":"ON2FDW654ET6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ON2FDW654ET6H5IF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ON2FDW65","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ON2FDW654ET6H5IFTLWJDX7BXB","target":"record","payload":{"canonical_record":{"source":{"id":"1208.1661","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T13:29:51Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"104f4267a64b779ff3043eac77f6cbca8ca4ba7d0019c63265aa9a856f56a8de","abstract_canon_sha256":"58fccef09f3926eed3ef62c60f29b14aca8615113a0264ec18f11214eeda6ca6"},"schema_version":"1.0"},"canonical_sha256":"737451dbdde127e3f5059aec91dfe1b8628bcea06f246e7455871eb642979fdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:25.607741Z","signature_b64":"yHQ96yWIznH9B9xzB2sOYxMLsoQbPaimt61KqmmW3qbVkVYmCte/4rdzdSsek34JyUBHvtGT356GB/BRIOwwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737451dbdde127e3f5059aec91dfe1b8628bcea06f246e7455871eb642979fdf","last_reissued_at":"2026-05-18T03:35:25.607014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:25.607014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.1661","source_version":2,"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-18T03:35:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uh8VH2nfYCKLLuPMnxznUAggnFz52iQWSALM1QgibxYxQMwOAVYpCL6yBDyUIE2yiflOpzDZM9uknayXOwPTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:48:10.293953Z"},"content_sha256":"71f97defcd06306dc3772a90ed2f767ee7e24206d133a5a6339f369888e3036e","schema_version":"1.0","event_id":"sha256:71f97defcd06306dc3772a90ed2f767ee7e24206d133a5a6339f369888e3036e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ON2FDW654ET6H5IFTLWJDX7BXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Proportional Representation as Resource Allocation: Approximability Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"Arkadii Slinko, Piotr Faliszewski, Piotr Skowron","submitted_at":"2012-08-08T13:29:51Z","abstract_excerpt":"We model Monroe's and Chamberlin and Courant's multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions, there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (briefly put, these variants correspond to optimizing total voter satisfaction under Borda scores, within Monroe's and Chamberlin and Courant's voting systems)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1661","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"},"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-18T03:35:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBlIarbwa2EBBLMIhaZvPYH/jqnAbqfodEj71HDWiRKc1HiQ7JF5eTaudgji5ZPt/bk6GSW9BfELeY0cX8MUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:48:10.294297Z"},"content_sha256":"43d32aae3a60196712d883e5e81bff148bc31b88207887e2ababb165ce08e363","schema_version":"1.0","event_id":"sha256:43d32aae3a60196712d883e5e81bff148bc31b88207887e2ababb165ce08e363"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ON2FDW654ET6H5IFTLWJDX7BXB/bundle.json","state_url":"https://pith.science/pith/ON2FDW654ET6H5IFTLWJDX7BXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ON2FDW654ET6H5IFTLWJDX7BXB/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-01T21:48:10Z","links":{"resolver":"https://pith.science/pith/ON2FDW654ET6H5IFTLWJDX7BXB","bundle":"https://pith.science/pith/ON2FDW654ET6H5IFTLWJDX7BXB/bundle.json","state":"https://pith.science/pith/ON2FDW654ET6H5IFTLWJDX7BXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ON2FDW654ET6H5IFTLWJDX7BXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ON2FDW654ET6H5IFTLWJDX7BXB","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":"58fccef09f3926eed3ef62c60f29b14aca8615113a0264ec18f11214eeda6ca6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T13:29:51Z","title_canon_sha256":"104f4267a64b779ff3043eac77f6cbca8ca4ba7d0019c63265aa9a856f56a8de"},"schema_version":"1.0","source":{"id":"1208.1661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.1661","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"arxiv_version","alias_value":"1208.1661v2","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1661","created_at":"2026-05-18T03:35:25Z"},{"alias_kind":"pith_short_12","alias_value":"ON2FDW654ET6","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ON2FDW654ET6H5IF","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ON2FDW65","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:43d32aae3a60196712d883e5e81bff148bc31b88207887e2ababb165ce08e363","target":"graph","created_at":"2026-05-18T03:35:25Z","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":"We model Monroe's and Chamberlin and Courant's multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions, there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (briefly put, these variants correspond to optimizing total voter satisfaction under Borda scores, within Monroe's and Chamberlin and Courant's voting systems).","authors_text":"Arkadii Slinko, Piotr Faliszewski, Piotr Skowron","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T13:29:51Z","title":"Fully Proportional Representation as Resource Allocation: Approximability Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1661","kind":"arxiv","version":2},"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:71f97defcd06306dc3772a90ed2f767ee7e24206d133a5a6339f369888e3036e","target":"record","created_at":"2026-05-18T03:35:25Z","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":"58fccef09f3926eed3ef62c60f29b14aca8615113a0264ec18f11214eeda6ca6","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-08T13:29:51Z","title_canon_sha256":"104f4267a64b779ff3043eac77f6cbca8ca4ba7d0019c63265aa9a856f56a8de"},"schema_version":"1.0","source":{"id":"1208.1661","kind":"arxiv","version":2}},"canonical_sha256":"737451dbdde127e3f5059aec91dfe1b8628bcea06f246e7455871eb642979fdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737451dbdde127e3f5059aec91dfe1b8628bcea06f246e7455871eb642979fdf","first_computed_at":"2026-05-18T03:35:25.607014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:25.607014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHQ96yWIznH9B9xzB2sOYxMLsoQbPaimt61KqmmW3qbVkVYmCte/4rdzdSsek34JyUBHvtGT356GB/BRIOwwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:25.607741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.1661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71f97defcd06306dc3772a90ed2f767ee7e24206d133a5a6339f369888e3036e","sha256:43d32aae3a60196712d883e5e81bff148bc31b88207887e2ababb165ce08e363"],"state_sha256":"a6456707d644654e3b71c911d93d2b3dcbed81ae7563b3e7151b54877b3dc40d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkATeBNerRyj3G6DH88EOFrVU9/GtI3xw1qDch1W0tu2Wmzcd8TAl9XU55+iQCB1NKqAC5LwuQYwTPaanulIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:48:10.296465Z","bundle_sha256":"24886cc0953bd7b2c68ed490d7e28374a79574c418fc114dd7d70abaf30e4b06"}}