{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:H3IRMDTXFELTHIGLI4D4XX645X","short_pith_number":"pith:H3IRMDTX","schema_version":"1.0","canonical_sha256":"3ed1160e77291733a0cb4707cbdfdcedc7e872388753a292f33bd286c854dbe2","source":{"kind":"arxiv","id":"1909.01986","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Intractability of Even Set and Shortest Vector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arnab Bhattacharyya, Bingkai Lin, D\\'aniel Marx, \\'Edouard Bonnet, Karthik C. S., L\\'aszl\\'o Egri, Pasin Manurangsi, Suprovat Ghoshal","submitted_at":"2019-09-04T10:18:08Z","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$, or in other words, whether there is a nonzero vector $\\mathbf{x}$ such that $\\mathbf A \\mathbf{x}$ has at most $k$ nonzero coordinates. The question of whether $k$-Even Set is fixed parameter tractable (FPT) parameterized by the distance $k$ has been repeatedly raised in literature; in fact, it is one of the few"},"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":"1909.01986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-09-04T10:18:08Z","cross_cats_sorted":[],"title_canon_sha256":"a7ea0cfd703f3e9a287c2a278971d453bce7d727a51cd3cea4dbdcec64911322","abstract_canon_sha256":"70514f611e023e05d0a68c2a7c07efc8be24ab4c4a9b3d8d0cdb8aeb4eef82f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:29.361311Z","signature_b64":"Cloy75ZMlR8rZelvrmjSWsSGvBO3Q7G0fS4oLQmg7//00HIsq3vEzR9liteWBKW/FYhC6syOVl1jdgJfBGyZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed1160e77291733a0cb4707cbdfdcedc7e872388753a292f33bd286c854dbe2","last_reissued_at":"2026-07-05T00:02:29.360840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:29.360840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Intractability of Even Set and Shortest Vector Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arnab Bhattacharyya, Bingkai Lin, D\\'aniel Marx, \\'Edouard Bonnet, Karthik C. S., L\\'aszl\\'o Egri, Pasin Manurangsi, Suprovat Ghoshal","submitted_at":"2019-09-04T10:18:08Z","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$, or in other words, whether there is a nonzero vector $\\mathbf{x}$ such that $\\mathbf A \\mathbf{x}$ has at most $k$ nonzero coordinates. The question of whether $k$-Even Set is fixed parameter tractable (FPT) parameterized by the distance $k$ has been repeatedly raised in literature; in fact, it is one of the few"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01986","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/1909.01986/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":"1909.01986","created_at":"2026-07-05T00:02:29.360916+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01986v1","created_at":"2026-07-05T00:02:29.360916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01986","created_at":"2026-07-05T00:02:29.360916+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3IRMDTXFELT","created_at":"2026-07-05T00:02:29.360916+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3IRMDTXFELTHIGL","created_at":"2026-07-05T00:02:29.360916+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3IRMDTX","created_at":"2026-07-05T00:02:29.360916+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/H3IRMDTXFELTHIGLI4D4XX645X","json":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X.json","graph_json":"https://pith.science/api/pith-number/H3IRMDTXFELTHIGLI4D4XX645X/graph.json","events_json":"https://pith.science/api/pith-number/H3IRMDTXFELTHIGLI4D4XX645X/events.json","paper":"https://pith.science/paper/H3IRMDTX"},"agent_actions":{"view_html":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X","download_json":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X.json","view_paper":"https://pith.science/paper/H3IRMDTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01986&json=true","fetch_graph":"https://pith.science/api/pith-number/H3IRMDTXFELTHIGLI4D4XX645X/graph.json","fetch_events":"https://pith.science/api/pith-number/H3IRMDTXFELTHIGLI4D4XX645X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X/action/storage_attestation","attest_author":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X/action/author_attestation","sign_citation":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X/action/citation_signature","submit_replication":"https://pith.science/pith/H3IRMDTXFELTHIGLI4D4XX645X/action/replication_record"}},"created_at":"2026-07-05T00:02:29.360916+00:00","updated_at":"2026-07-05T00:02:29.360916+00:00"}