{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R724K2SCBE6M7MXBUX5CQIYDQR","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":"33fa7eb8a10ff024f6f2b2a0de61901a3304e23c8b19916b0c91dfd1f8f3a771","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-17T18:30:09Z","title_canon_sha256":"5c50c3d98610febae33d5797c7bda8679623caf97048f5ae095b6a6fe56d591b"},"schema_version":"1.0","source":{"id":"1006.3541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3541","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3541v1","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3541","created_at":"2026-05-18T03:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"R724K2SCBE6M","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R724K2SCBE6M7MXB","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R724K2SC","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:f6a640730d7735c03e9ae8e583c5b574ae5f51afb0bdb005fcfd1b023e979c9b","target":"graph","created_at":"2026-05-18T03:58:04Z","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":"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","authors_text":"Celina M. H. de Figueiredo, Guilherme D. da Fonseca, Raphael Machado, Vin\\'icius G. P. de S\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-17T18:30:09Z","title":"Complexity dichotomy on partial grid recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3541","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:0161f17e2ce1b895280879fe374b456942d6bf1a3ec8121b95120aeb372b8262","target":"record","created_at":"2026-05-18T03:58:04Z","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":"33fa7eb8a10ff024f6f2b2a0de61901a3304e23c8b19916b0c91dfd1f8f3a771","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-17T18:30:09Z","title_canon_sha256":"5c50c3d98610febae33d5797c7bda8679623caf97048f5ae095b6a6fe56d591b"},"schema_version":"1.0","source":{"id":"1006.3541","kind":"arxiv","version":1}},"canonical_sha256":"8ff5c56a42093ccfb2e1a5fa282303845dc18ef8e488b0af7d75b344312d8822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff5c56a42093ccfb2e1a5fa282303845dc18ef8e488b0af7d75b344312d8822","first_computed_at":"2026-05-18T03:58:04.708823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:04.708823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wpwlnyec8ICVhDIe0wnjQYU5nzAqzQuswMB//C+hkCmXSKuRjoqWmQH79VWqG1+Kb+9dAkg0uaWXOClgLCr7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:04.709217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0161f17e2ce1b895280879fe374b456942d6bf1a3ec8121b95120aeb372b8262","sha256:f6a640730d7735c03e9ae8e583c5b574ae5f51afb0bdb005fcfd1b023e979c9b"],"state_sha256":"8e2025c2ac439dd1524d1f0cb3902431286cf0a77a0571111e1cf9c709daa8b8"}