{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3WM5PRXDLT4AHJB4SXMBGBPIUE","short_pith_number":"pith:3WM5PRXD","canonical_record":{"source":{"id":"1803.09717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-26T17:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"b3a08b83736e83188fc962a602e513546d627c3b2c2982045fcbd9b536904ccc","abstract_canon_sha256":"834a32c992674c0b06f444bc981f628e72e9139636e4078fadb6361d2ce8ba76"},"schema_version":"1.0"},"canonical_sha256":"dd99d7c6e35cf803a43c95d81305e8a11b1e7417bff4ccccde9a54a70215aab1","source":{"kind":"arxiv","id":"1803.09717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09717","created_at":"2026-05-18T00:20:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09717v1","created_at":"2026-05-18T00:20:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09717","created_at":"2026-05-18T00:20:10Z"},{"alias_kind":"pith_short_12","alias_value":"3WM5PRXDLT4A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3WM5PRXDLT4AHJB4","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3WM5PRXD","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3WM5PRXDLT4AHJB4SXMBGBPIUE","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-26T17:13:43Z","cross_cats_sorted":[],"title_canon_sha256":"b3a08b83736e83188fc962a602e513546d627c3b2c2982045fcbd9b536904ccc","abstract_canon_sha256":"834a32c992674c0b06f444bc981f628e72e9139636e4078fadb6361d2ce8ba76"},"schema_version":"1.0"},"canonical_sha256":"dd99d7c6e35cf803a43c95d81305e8a11b1e7417bff4ccccde9a54a70215aab1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:10.603143Z","signature_b64":"iwCGyAKJQpSEArVAAmSEHCnjZl3Qa1gn906szkfka70BbqAlDu7xM0fa0fSCDa7ab289oWKKHdgZjmuEQIMeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd99d7c6e35cf803a43c95d81305e8a11b1e7417bff4ccccde9a54a70215aab1","last_reissued_at":"2026-05-18T00:20:10.602408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:10.602408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09717","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-18T00:20:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmhlsoSBxySk6ydv9YxZ7lsocn0J07bID4rB4yMMNG7OZiwPniaHcApGkrtFMnpR4UPyNjtWjbjTrlT7AgHlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:27:14.083675Z"},"content_sha256":"f2151836424d43d429731d4d9d0d82bd1083c7c11859ff69aa53715ac415c5d1","schema_version":"1.0","event_id":"sha256:f2151836424d43d429731d4d9d0d82bd1083c7c11859ff69aa53715ac415c5d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3WM5PRXDLT4AHJB4SXMBGBPIUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arnab Bhattacharyya, Karthik C. S., Pasin Manurangsi, Suprovat Ghoshal","submitted_at":"2018-03-26T17:13:43Z","abstract_excerpt":"The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\\mathbb F_2$, which can be stated as follows: given a generator matrix $\\mathbf A$ and an integer $k$, determine whether the code generated by $\\mathbf A$ has distance at most $k$. Here, $k$ is the parameter of the problem. The question of whether $k$-Even Set is fixed parameter tractable (FPT) has been repeatedly raised in literature and has earned its place in Downey and Fellows' book (2013) as one of the \"most infamous\" open problems in the field of Parameterized Complexity.\n  In this w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09717","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-18T00:20:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egaSYBUHbYFl08KkmSEJ8gqfCrO2fAuxmTo0g3w+FgQrrgMEAJZPCqyyj6VjhxEDKzWABcAJsAibwkfgAGYsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:27:14.084044Z"},"content_sha256":"4fe41f0f4f4358af68723d30d894562bc8d0caea5478ec87619c3a49889b03ad","schema_version":"1.0","event_id":"sha256:4fe41f0f4f4358af68723d30d894562bc8d0caea5478ec87619c3a49889b03ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE/bundle.json","state_url":"https://pith.science/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE/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-01T14:27:14Z","links":{"resolver":"https://pith.science/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE","bundle":"https://pith.science/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE/bundle.json","state":"https://pith.science/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WM5PRXDLT4AHJB4SXMBGBPIUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3WM5PRXDLT4AHJB4SXMBGBPIUE","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":"834a32c992674c0b06f444bc981f628e72e9139636e4078fadb6361d2ce8ba76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-26T17:13:43Z","title_canon_sha256":"b3a08b83736e83188fc962a602e513546d627c3b2c2982045fcbd9b536904ccc"},"schema_version":"1.0","source":{"id":"1803.09717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09717","created_at":"2026-05-18T00:20:10Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09717v1","created_at":"2026-05-18T00:20:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09717","created_at":"2026-05-18T00:20:10Z"},{"alias_kind":"pith_short_12","alias_value":"3WM5PRXDLT4A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3WM5PRXDLT4AHJB4","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3WM5PRXD","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:4fe41f0f4f4358af68723d30d894562bc8d0caea5478ec87619c3a49889b03ad","target":"graph","created_at":"2026-05-18T00:20:10Z","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":"The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\\mathbb F_2$, which can be stated as follows: given a generator matrix $\\mathbf A$ and an integer $k$, determine whether the code generated by $\\mathbf A$ has distance at most $k$. Here, $k$ is the parameter of the problem. The question of whether $k$-Even Set is fixed parameter tractable (FPT) has been repeatedly raised in literature and has earned its place in Downey and Fellows' book (2013) as one of the \"most infamous\" open problems in the field of Parameterized Complexity.\n  In this w","authors_text":"Arnab Bhattacharyya, Karthik C. S., Pasin Manurangsi, Suprovat Ghoshal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-26T17:13:43Z","title":"Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09717","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:f2151836424d43d429731d4d9d0d82bd1083c7c11859ff69aa53715ac415c5d1","target":"record","created_at":"2026-05-18T00:20:10Z","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":"834a32c992674c0b06f444bc981f628e72e9139636e4078fadb6361d2ce8ba76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-26T17:13:43Z","title_canon_sha256":"b3a08b83736e83188fc962a602e513546d627c3b2c2982045fcbd9b536904ccc"},"schema_version":"1.0","source":{"id":"1803.09717","kind":"arxiv","version":1}},"canonical_sha256":"dd99d7c6e35cf803a43c95d81305e8a11b1e7417bff4ccccde9a54a70215aab1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd99d7c6e35cf803a43c95d81305e8a11b1e7417bff4ccccde9a54a70215aab1","first_computed_at":"2026-05-18T00:20:10.602408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:10.602408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iwCGyAKJQpSEArVAAmSEHCnjZl3Qa1gn906szkfka70BbqAlDu7xM0fa0fSCDa7ab289oWKKHdgZjmuEQIMeBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:10.603143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2151836424d43d429731d4d9d0d82bd1083c7c11859ff69aa53715ac415c5d1","sha256:4fe41f0f4f4358af68723d30d894562bc8d0caea5478ec87619c3a49889b03ad"],"state_sha256":"5d82d8d0deeccf45296f794fdfc9bd287eaac2748ddaa24cb9131cfccf192bb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"muykIYBh1NOnbrujaYd0ve/5kbJJoNP7plKQcvO2IqOzDGju3KFWl8rCaSp/s/Lli0+rQTu7lsH5TJsivjwqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:27:14.086178Z","bundle_sha256":"789070d5f8a52103552aadee4b0ea82e017567b2f35f7936645db005563abbd6"}}