{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7UBD3T5LQMNLKBPNGHI62AM64P","short_pith_number":"pith:7UBD3T5L","schema_version":"1.0","canonical_sha256":"fd023dcfab831ab505ed31d1ed019ee3e93d0c0813e20b7aa7ca2cfe5e9299b4","source":{"kind":"arxiv","id":"1803.01176","version":2},"attestation_state":"computed","paper":{"title":"Path Puzzles: Discrete Tomography with a Path Constraint is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adam Hesterberg, Erik D. Demaine, Jeffrey Bosboom, Justin Kopinsky, Martin L. Demaine, Roderick Kimball","submitted_at":"2018-03-03T14:42:23Z","abstract_excerpt":"We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly establish ASP-completeness and #P-completeness for 3-Dimensional Matching and Numerical 3-Dimensional Matching."},"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":"1803.01176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-03T14:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"5e3cb82a80e2e045857523cb2b70e22ad4dbb3406527f89859350a578b28b60d","abstract_canon_sha256":"298cb6a26aa4d16d123d3199b3c981742ecd5519c1fe896734c7b6d6ef2ceccc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:25.273202Z","signature_b64":"0D19bnt12x3xNmGpcOrW7qW9BdncndXvFdJaVv1aKYPw8NujmojnR1OsbZt/hA3wJz4RLPcpy+sn+WtvzaOKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd023dcfab831ab505ed31d1ed019ee3e93d0c0813e20b7aa7ca2cfe5e9299b4","last_reissued_at":"2026-05-17T23:54:25.272667Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:25.272667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Puzzles: Discrete Tomography with a Path Constraint is Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adam Hesterberg, Erik D. Demaine, Jeffrey Bosboom, Justin Kopinsky, Martin L. Demaine, Roderick Kimball","submitted_at":"2018-03-03T14:42:23Z","abstract_excerpt":"We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly establish ASP-completeness and #P-completeness for 3-Dimensional Matching and Numerical 3-Dimensional Matching."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01176","kind":"arxiv","version":2},"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":"1803.01176","created_at":"2026-05-17T23:54:25.272731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01176v2","created_at":"2026-05-17T23:54:25.272731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01176","created_at":"2026-05-17T23:54:25.272731+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UBD3T5LQMNL","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UBD3T5LQMNLKBPN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UBD3T5L","created_at":"2026-05-18T12:32:11.075285+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/7UBD3T5LQMNLKBPNGHI62AM64P","json":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P.json","graph_json":"https://pith.science/api/pith-number/7UBD3T5LQMNLKBPNGHI62AM64P/graph.json","events_json":"https://pith.science/api/pith-number/7UBD3T5LQMNLKBPNGHI62AM64P/events.json","paper":"https://pith.science/paper/7UBD3T5L"},"agent_actions":{"view_html":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P","download_json":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P.json","view_paper":"https://pith.science/paper/7UBD3T5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01176&json=true","fetch_graph":"https://pith.science/api/pith-number/7UBD3T5LQMNLKBPNGHI62AM64P/graph.json","fetch_events":"https://pith.science/api/pith-number/7UBD3T5LQMNLKBPNGHI62AM64P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P/action/storage_attestation","attest_author":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P/action/author_attestation","sign_citation":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P/action/citation_signature","submit_replication":"https://pith.science/pith/7UBD3T5LQMNLKBPNGHI62AM64P/action/replication_record"}},"created_at":"2026-05-17T23:54:25.272731+00:00","updated_at":"2026-05-17T23:54:25.272731+00:00"}