{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CPZ7FCIP2O26VHSNB5I37AZZOK","short_pith_number":"pith:CPZ7FCIP","canonical_record":{"source":{"id":"1905.11838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:20:33Z","cross_cats_sorted":["cs.AI","cs.CY","cs.DS","cs.GT"],"title_canon_sha256":"e85a2c37e2b0a475e5b3d82949597ff4f8add10cdc2159945c248cc99814b15f","abstract_canon_sha256":"f2885c5dedd4671647fa0af89450d552c064bd153d8a3d2ad327b41cc3afc45b"},"schema_version":"1.0"},"canonical_sha256":"13f3f2890fd3b5ea9e4d0f51bf83397290374f9d22cceb0fe3daf06856ca6464","source":{"kind":"arxiv","id":"1905.11838","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11838","created_at":"2026-05-17T23:44:50Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11838v1","created_at":"2026-05-17T23:44:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11838","created_at":"2026-05-17T23:44:50Z"},{"alias_kind":"pith_short_12","alias_value":"CPZ7FCIP2O26","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPZ7FCIP2O26VHSN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPZ7FCIP","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CPZ7FCIP2O26VHSNB5I37AZZOK","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:20:33Z","cross_cats_sorted":["cs.AI","cs.CY","cs.DS","cs.GT"],"title_canon_sha256":"e85a2c37e2b0a475e5b3d82949597ff4f8add10cdc2159945c248cc99814b15f","abstract_canon_sha256":"f2885c5dedd4671647fa0af89450d552c064bd153d8a3d2ad327b41cc3afc45b"},"schema_version":"1.0"},"canonical_sha256":"13f3f2890fd3b5ea9e4d0f51bf83397290374f9d22cceb0fe3daf06856ca6464","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:50.130298Z","signature_b64":"+ZPuHTuoPKogV7dwZZ1ON5ZEe6SDAS4VL2QFUQSxgmRRxSI2Hc4m11MmvzuFd8Dqzgzdwoe9JumSKOHsaUjGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13f3f2890fd3b5ea9e4d0f51bf83397290374f9d22cceb0fe3daf06856ca6464","last_reissued_at":"2026-05-17T23:44:50.129833Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:50.129833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11838","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-17T23:44:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RuMvZB1Kt46i9c3bzrX+xRLlx6QXcIdjy8DWM7DlP7rRaCHow/llMVZKUlKL9vLyCGH+wsoTTaFBAKDS8GiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:25.216851Z"},"content_sha256":"263a29781874de9a2583ecb80a911a63cf4393381136adf100c0e8dc207a90c6","schema_version":"1.0","event_id":"sha256:263a29781874de9a2583ecb80a911a63cf4393381136adf100c0e8dc207a90c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CPZ7FCIP2O26VHSNB5I37AZZOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Perspective on Protecting Elections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CY","cs.DS","cs.GT"],"primary_cat":"cs.MA","authors_text":"Garima Shakya, Neeldhara Misra, Palash Dey, Swaprava Nath","submitted_at":"2019-05-28T14:20:33Z","abstract_excerpt":"We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and $k_d$ corresponding to respectively the number of voter groups the attacker can attack and the number of voter groups the defender can defend. A voter group gets removed from the election if it is attacked but not defended. In the optimal defense problem, we want to know if it is possible for the defender to commit to a strategy of defending at most $k_d$ voter groups such th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11838","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-17T23:44:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iXQ7AkWvn2AzW6yyxHB4RuLK42TBgugzwSEyh7+ONPjSnmVuJC3kAqcMVO5siYjPcp+KjbgBM6D6HscbqzYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:25.217193Z"},"content_sha256":"6e52a63411b84eb794811d1477d76d94a2a43937e56ac1e629b5d1714e1dc198","schema_version":"1.0","event_id":"sha256:6e52a63411b84eb794811d1477d76d94a2a43937e56ac1e629b5d1714e1dc198"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPZ7FCIP2O26VHSNB5I37AZZOK/bundle.json","state_url":"https://pith.science/pith/CPZ7FCIP2O26VHSNB5I37AZZOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPZ7FCIP2O26VHSNB5I37AZZOK/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-01T19:38:25Z","links":{"resolver":"https://pith.science/pith/CPZ7FCIP2O26VHSNB5I37AZZOK","bundle":"https://pith.science/pith/CPZ7FCIP2O26VHSNB5I37AZZOK/bundle.json","state":"https://pith.science/pith/CPZ7FCIP2O26VHSNB5I37AZZOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPZ7FCIP2O26VHSNB5I37AZZOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CPZ7FCIP2O26VHSNB5I37AZZOK","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":"f2885c5dedd4671647fa0af89450d552c064bd153d8a3d2ad327b41cc3afc45b","cross_cats_sorted":["cs.AI","cs.CY","cs.DS","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:20:33Z","title_canon_sha256":"e85a2c37e2b0a475e5b3d82949597ff4f8add10cdc2159945c248cc99814b15f"},"schema_version":"1.0","source":{"id":"1905.11838","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11838","created_at":"2026-05-17T23:44:50Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11838v1","created_at":"2026-05-17T23:44:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11838","created_at":"2026-05-17T23:44:50Z"},{"alias_kind":"pith_short_12","alias_value":"CPZ7FCIP2O26","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CPZ7FCIP2O26VHSN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CPZ7FCIP","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:6e52a63411b84eb794811d1477d76d94a2a43937e56ac1e629b5d1714e1dc198","target":"graph","created_at":"2026-05-17T23:44:50Z","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 study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and $k_d$ corresponding to respectively the number of voter groups the attacker can attack and the number of voter groups the defender can defend. A voter group gets removed from the election if it is attacked but not defended. In the optimal defense problem, we want to know if it is possible for the defender to commit to a strategy of defending at most $k_d$ voter groups such th","authors_text":"Garima Shakya, Neeldhara Misra, Palash Dey, Swaprava Nath","cross_cats":["cs.AI","cs.CY","cs.DS","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:20:33Z","title":"A Parameterized Perspective on Protecting Elections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11838","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:263a29781874de9a2583ecb80a911a63cf4393381136adf100c0e8dc207a90c6","target":"record","created_at":"2026-05-17T23:44:50Z","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":"f2885c5dedd4671647fa0af89450d552c064bd153d8a3d2ad327b41cc3afc45b","cross_cats_sorted":["cs.AI","cs.CY","cs.DS","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-28T14:20:33Z","title_canon_sha256":"e85a2c37e2b0a475e5b3d82949597ff4f8add10cdc2159945c248cc99814b15f"},"schema_version":"1.0","source":{"id":"1905.11838","kind":"arxiv","version":1}},"canonical_sha256":"13f3f2890fd3b5ea9e4d0f51bf83397290374f9d22cceb0fe3daf06856ca6464","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13f3f2890fd3b5ea9e4d0f51bf83397290374f9d22cceb0fe3daf06856ca6464","first_computed_at":"2026-05-17T23:44:50.129833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:50.129833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ZPuHTuoPKogV7dwZZ1ON5ZEe6SDAS4VL2QFUQSxgmRRxSI2Hc4m11MmvzuFd8Dqzgzdwoe9JumSKOHsaUjGDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:50.130298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11838","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:263a29781874de9a2583ecb80a911a63cf4393381136adf100c0e8dc207a90c6","sha256:6e52a63411b84eb794811d1477d76d94a2a43937e56ac1e629b5d1714e1dc198"],"state_sha256":"8f71806d069072d462f02887299374b098cd106f01338a7c9b9514c90a6ffa5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UP7LWhssSKN6tricnVl33CeNgQOiAv2b/tBWaM9xfwg8Cybfvsl2PHBTe27EQVSpmeESHI89u7b5wcGWCmwPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:25.219061Z","bundle_sha256":"4cfc2239e521ee8cf5deb5ded8609940c91a732065296495a79a6c9c7ea7c59e"}}