{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ENUX7QYWCAU3UOM2TV6MGF73GI","short_pith_number":"pith:ENUX7QYW","schema_version":"1.0","canonical_sha256":"23697fc3161029ba399a9d7cc317fb32302d271fe50cc2dfbd20e591a0f61049","source":{"kind":"arxiv","id":"1703.06423","version":1},"attestation_state":"computed","paper":{"title":"The Hardness of Embedding Grids and Walls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin, Martin Grohe, Yijia Chen","submitted_at":"2017-03-19T11:24:26Z","abstract_excerpt":"The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of \"pattern graphs\" can be embedded into a given graph $H$ (that is, is isomorphic to a subgraph of $H$) is fixed-parameter tractable if $K$ is a class of graphs of bounded tree width and $W[1]$-complete otherwise.\n  Towards this conjecture, we prove that the embedding problem is $W[1]$-complete if $K$ is the class of all grids or the class of all walls."},"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":"1703.06423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-03-19T11:24:26Z","cross_cats_sorted":[],"title_canon_sha256":"6d636d6a8dfb3c677f49532c24cfab18555ab93d6099ef3df75e1660eb286d60","abstract_canon_sha256":"89458d5c158c5e13c5f1b90d5e49fc66d89132335dc5ba1b9be5e47106e62683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:22.931072Z","signature_b64":"prxAz2XE9WJxmcGuSP8kgl/zv+hMp55R8LCPu0mo2d5lY/E+pjNgarFZT16kyiYB/9R5e8j//TeN98EHj4k9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23697fc3161029ba399a9d7cc317fb32302d271fe50cc2dfbd20e591a0f61049","last_reissued_at":"2026-05-18T00:48:22.930561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:22.930561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Hardness of Embedding Grids and Walls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bingkai Lin, Martin Grohe, Yijia Chen","submitted_at":"2017-03-19T11:24:26Z","abstract_excerpt":"The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of \"pattern graphs\" can be embedded into a given graph $H$ (that is, is isomorphic to a subgraph of $H$) is fixed-parameter tractable if $K$ is a class of graphs of bounded tree width and $W[1]$-complete otherwise.\n  Towards this conjecture, we prove that the embedding problem is $W[1]$-complete if $K$ is the class of all grids or the class of all walls."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06423","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.06423","created_at":"2026-05-18T00:48:22.930645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06423v1","created_at":"2026-05-18T00:48:22.930645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06423","created_at":"2026-05-18T00:48:22.930645+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENUX7QYWCAU3","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENUX7QYWCAU3UOM2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENUX7QYW","created_at":"2026-05-18T12:31:12.930513+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/ENUX7QYWCAU3UOM2TV6MGF73GI","json":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI.json","graph_json":"https://pith.science/api/pith-number/ENUX7QYWCAU3UOM2TV6MGF73GI/graph.json","events_json":"https://pith.science/api/pith-number/ENUX7QYWCAU3UOM2TV6MGF73GI/events.json","paper":"https://pith.science/paper/ENUX7QYW"},"agent_actions":{"view_html":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI","download_json":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI.json","view_paper":"https://pith.science/paper/ENUX7QYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06423&json=true","fetch_graph":"https://pith.science/api/pith-number/ENUX7QYWCAU3UOM2TV6MGF73GI/graph.json","fetch_events":"https://pith.science/api/pith-number/ENUX7QYWCAU3UOM2TV6MGF73GI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI/action/storage_attestation","attest_author":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI/action/author_attestation","sign_citation":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI/action/citation_signature","submit_replication":"https://pith.science/pith/ENUX7QYWCAU3UOM2TV6MGF73GI/action/replication_record"}},"created_at":"2026-05-18T00:48:22.930645+00:00","updated_at":"2026-05-18T00:48:22.930645+00:00"}