{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R724K2SCBE6M7MXBUX5CQIYDQR","short_pith_number":"pith:R724K2SC","schema_version":"1.0","canonical_sha256":"8ff5c56a42093ccfb2e1a5fa282303845dc18ef8e488b0af7d75b344312d8822","source":{"kind":"arxiv","id":"1006.3541","version":1},"attestation_state":"computed","paper":{"title":"Complexity dichotomy on partial grid recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Raphael Machado, Vin\\'icius G. P. de S\\'a","submitted_at":"2010-06-17T18:30:09Z","abstract_excerpt":"Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even trivial. A natural step, outstanding thus far, was to provide a broad classification of graphs that make for polynomial or NP-complete instances. We provide such a classification based on the set of allowed vertex degrees in the input graphs, yielding a full dichotomy on the complexity of the problem. As byproducts, the previous NP-completeness result for b"},"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":"1006.3541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-17T18:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"5c50c3d98610febae33d5797c7bda8679623caf97048f5ae095b6a6fe56d591b","abstract_canon_sha256":"33fa7eb8a10ff024f6f2b2a0de61901a3304e23c8b19916b0c91dfd1f8f3a771"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:04.709217Z","signature_b64":"wpwlnyec8ICVhDIe0wnjQYU5nzAqzQuswMB//C+hkCmXSKuRjoqWmQH79VWqG1+Kb+9dAkg0uaWXOClgLCr7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff5c56a42093ccfb2e1a5fa282303845dc18ef8e488b0af7d75b344312d8822","last_reissued_at":"2026-05-18T03:58:04.708823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:04.708823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity dichotomy on partial grid recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Raphael Machado, Vin\\'icius G. P. de S\\'a","submitted_at":"2010-06-17T18:30:09Z","abstract_excerpt":"Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even trivial. A natural step, outstanding thus far, was to provide a broad classification of graphs that make for polynomial or NP-complete instances. We provide such a classification based on the set of allowed vertex degrees in the input graphs, yielding a full dichotomy on the complexity of the problem. As byproducts, the previous NP-completeness result for b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3541","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":"1006.3541","created_at":"2026-05-18T03:58:04.708885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.3541v1","created_at":"2026-05-18T03:58:04.708885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3541","created_at":"2026-05-18T03:58:04.708885+00:00"},{"alias_kind":"pith_short_12","alias_value":"R724K2SCBE6M","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R724K2SCBE6M7MXB","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R724K2SC","created_at":"2026-05-18T12:26:13.927090+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/R724K2SCBE6M7MXBUX5CQIYDQR","json":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR.json","graph_json":"https://pith.science/api/pith-number/R724K2SCBE6M7MXBUX5CQIYDQR/graph.json","events_json":"https://pith.science/api/pith-number/R724K2SCBE6M7MXBUX5CQIYDQR/events.json","paper":"https://pith.science/paper/R724K2SC"},"agent_actions":{"view_html":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR","download_json":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR.json","view_paper":"https://pith.science/paper/R724K2SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.3541&json=true","fetch_graph":"https://pith.science/api/pith-number/R724K2SCBE6M7MXBUX5CQIYDQR/graph.json","fetch_events":"https://pith.science/api/pith-number/R724K2SCBE6M7MXBUX5CQIYDQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR/action/storage_attestation","attest_author":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR/action/author_attestation","sign_citation":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR/action/citation_signature","submit_replication":"https://pith.science/pith/R724K2SCBE6M7MXBUX5CQIYDQR/action/replication_record"}},"created_at":"2026-05-18T03:58:04.708885+00:00","updated_at":"2026-05-18T03:58:04.708885+00:00"}