{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4FCD34435WVMI6WXYZPHUSSIOJ","short_pith_number":"pith:4FCD3443","canonical_record":{"source":{"id":"1410.5845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-21T20:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"c9a72d326521605a653955dfcca6693f1832fda3c722c2c0ca1a4eb2368bc7c9","abstract_canon_sha256":"91dc5b56f2e2662a41deda409fdbc2069037fa6d3b72fb65f107e17a0cdeb10b"},"schema_version":"1.0"},"canonical_sha256":"e1443df39bedaac47ad7c65e7a4a4872559deb93abca90bad2ee4926457c8cf2","source":{"kind":"arxiv","id":"1410.5845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5845","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5845v1","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5845","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"4FCD34435WVM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4FCD34435WVMI6WX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4FCD3443","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4FCD34435WVMI6WXYZPHUSSIOJ","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-21T20:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"c9a72d326521605a653955dfcca6693f1832fda3c722c2c0ca1a4eb2368bc7c9","abstract_canon_sha256":"91dc5b56f2e2662a41deda409fdbc2069037fa6d3b72fb65f107e17a0cdeb10b"},"schema_version":"1.0"},"canonical_sha256":"e1443df39bedaac47ad7c65e7a4a4872559deb93abca90bad2ee4926457c8cf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:33.107506Z","signature_b64":"h5BDZVHcCZkThVifqbYDc/kQlL09fqIxe/uYyhO0DQxTp2rp76MCIqjsIBTJPkN3wdIYqYf7jbmh3TRVS/UNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1443df39bedaac47ad7c65e7a4a4872559deb93abca90bad2ee4926457c8cf2","last_reissued_at":"2026-05-18T02:39:33.106891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:33.106891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5845","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QT/uPJoaqrm1x1oBkq6l3AMzYEuDsXvH/EKH4UwOb6/FMw6NUuTkek94AljshVECKj2uazdgesXWTpNXxzbgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:33:40.153801Z"},"content_sha256":"8c7fd21727b12ae6dc38720fe318b5fb286cb81e08d406b5540b674d187c9c80","schema_version":"1.0","event_id":"sha256:8c7fd21727b12ae6dc38720fe318b5fb286cb81e08d406b5540b674d187c9c80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4FCD34435WVMI6WXYZPHUSSIOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zig-Zag Numberlink is NP-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Adcock, Blair D. Sullivan, Erik D. Demaine, Felix Reidl, Fernando S\\'anchez Villaamil, Martin L. Demaine, Michael P. O'Brien","submitted_at":"2014-10-21T20:27:20Z","abstract_excerpt":"When can $t$ terminal pairs in an $m \\times n$ grid be connected by $t$ vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch's 1975 proof without the ``cover all vertices'' constraint, and Kotsuma and Takenaga's 2010 proof when the paths are restricted to have the fewest possible corners within their homotopy class. The latter restriction is a common form of the famous Nikoli puzzle \\emph{Numberlink}; our problem is another common form of Numberlink, sometimes called \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5845","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2zBhCLR4+t0Rzp7BC83e7qgz45i0FHzbK8Xv6HhsH1pSjLwndVari7xqgKMzvFMyOve6PWZT4uhkDLSSoI01CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:33:40.154484Z"},"content_sha256":"7dbfb11b4969ca6caa23c0f8a602ab5c91aed779fed0017107f2b7bd8b249ebc","schema_version":"1.0","event_id":"sha256:7dbfb11b4969ca6caa23c0f8a602ab5c91aed779fed0017107f2b7bd8b249ebc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FCD34435WVMI6WXYZPHUSSIOJ/bundle.json","state_url":"https://pith.science/pith/4FCD34435WVMI6WXYZPHUSSIOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FCD34435WVMI6WXYZPHUSSIOJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:33:40Z","links":{"resolver":"https://pith.science/pith/4FCD34435WVMI6WXYZPHUSSIOJ","bundle":"https://pith.science/pith/4FCD34435WVMI6WXYZPHUSSIOJ/bundle.json","state":"https://pith.science/pith/4FCD34435WVMI6WXYZPHUSSIOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FCD34435WVMI6WXYZPHUSSIOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4FCD34435WVMI6WXYZPHUSSIOJ","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":"91dc5b56f2e2662a41deda409fdbc2069037fa6d3b72fb65f107e17a0cdeb10b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-21T20:27:20Z","title_canon_sha256":"c9a72d326521605a653955dfcca6693f1832fda3c722c2c0ca1a4eb2368bc7c9"},"schema_version":"1.0","source":{"id":"1410.5845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5845","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5845v1","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5845","created_at":"2026-05-18T02:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"4FCD34435WVM","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4FCD34435WVMI6WX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4FCD3443","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:7dbfb11b4969ca6caa23c0f8a602ab5c91aed779fed0017107f2b7bd8b249ebc","target":"graph","created_at":"2026-05-18T02:39:33Z","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":"When can $t$ terminal pairs in an $m \\times n$ grid be connected by $t$ vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch's 1975 proof without the ``cover all vertices'' constraint, and Kotsuma and Takenaga's 2010 proof when the paths are restricted to have the fewest possible corners within their homotopy class. The latter restriction is a common form of the famous Nikoli puzzle \\emph{Numberlink}; our problem is another common form of Numberlink, sometimes called \\","authors_text":"Aaron Adcock, Blair D. Sullivan, Erik D. Demaine, Felix Reidl, Fernando S\\'anchez Villaamil, Martin L. Demaine, Michael P. O'Brien","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-21T20:27:20Z","title":"Zig-Zag Numberlink is NP-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5845","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:8c7fd21727b12ae6dc38720fe318b5fb286cb81e08d406b5540b674d187c9c80","target":"record","created_at":"2026-05-18T02:39:33Z","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":"91dc5b56f2e2662a41deda409fdbc2069037fa6d3b72fb65f107e17a0cdeb10b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-10-21T20:27:20Z","title_canon_sha256":"c9a72d326521605a653955dfcca6693f1832fda3c722c2c0ca1a4eb2368bc7c9"},"schema_version":"1.0","source":{"id":"1410.5845","kind":"arxiv","version":1}},"canonical_sha256":"e1443df39bedaac47ad7c65e7a4a4872559deb93abca90bad2ee4926457c8cf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1443df39bedaac47ad7c65e7a4a4872559deb93abca90bad2ee4926457c8cf2","first_computed_at":"2026-05-18T02:39:33.106891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:33.106891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h5BDZVHcCZkThVifqbYDc/kQlL09fqIxe/uYyhO0DQxTp2rp76MCIqjsIBTJPkN3wdIYqYf7jbmh3TRVS/UNCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:33.107506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c7fd21727b12ae6dc38720fe318b5fb286cb81e08d406b5540b674d187c9c80","sha256:7dbfb11b4969ca6caa23c0f8a602ab5c91aed779fed0017107f2b7bd8b249ebc"],"state_sha256":"be75c50de2345029e9622a9cf4d4594a0ba5a3e3d4890c35e9c68055ee16ba5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"as5ZJRVh+Bz1w3WegKm3pgceHLf2kVOoH8hHkhybQ2R7r6GVqskukXZZSBEyzHo9IonfvKKW9yu144P6QPjdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:33:40.157736Z","bundle_sha256":"d6d9001767844ce8d7960dd72ea7ea19e127e3153ee7e43dd15a41807c7e9820"}}