{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TTDUZDPM2DMXWV24VGECXKLVSV","short_pith_number":"pith:TTDUZDPM","schema_version":"1.0","canonical_sha256":"9cc74c8decd0d97b575ca9882ba975955680a88300e8d2d17aa2f12c4d5b2164","source":{"kind":"arxiv","id":"2502.13536","version":1},"attestation_state":"computed","paper":{"title":"Slant/Gokigen Naname is NP-complete, and Some Variations are in P","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Jack Spalding-Jamieson, Jayson Lynch","submitted_at":"2025-02-19T08:41:55Z","abstract_excerpt":"In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraints are omitted. These problems correspond to simultaneously satisfying connectivity and vertex degree constraints in a grid graph and its dual."},"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":"2502.13536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2025-02-19T08:41:55Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"15a069b27254d9a1a495bc845a0fed23a69f4549bce2f76cace365ee8e9ebe02","abstract_canon_sha256":"e3e424a051f9709f8b4d7c59fea5e99b2f303da9570339fe004819e711dd1263"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:16:48.791372Z","signature_b64":"8b4RLAjliAFk+YQGO/PDpCK5pBwQaLjKURn/sg64zQAymK52Qs5ICVQJ0tMK95jyAFofpReE7CoW6lNHy0gWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cc74c8decd0d97b575ca9882ba975955680a88300e8d2d17aa2f12c4d5b2164","last_reissued_at":"2026-07-05T10:16:48.790834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:16:48.790834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Slant/Gokigen Naname is NP-complete, and Some Variations are in P","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Jack Spalding-Jamieson, Jayson Lynch","submitted_at":"2025-02-19T08:41:55Z","abstract_excerpt":"In this paper we show that a generalized version of the Nikoli puzzle Slant is NP-complete. We also give polynomial time algorithms for versions of the puzzle where some constraints are omitted. These problems correspond to simultaneously satisfying connectivity and vertex degree constraints in a grid graph and its dual."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13536","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.13536/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.13536","created_at":"2026-07-05T10:16:48.790893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.13536v1","created_at":"2026-07-05T10:16:48.790893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13536","created_at":"2026-07-05T10:16:48.790893+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTDUZDPM2DMX","created_at":"2026-07-05T10:16:48.790893+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTDUZDPM2DMXWV24","created_at":"2026-07-05T10:16:48.790893+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTDUZDPM","created_at":"2026-07-05T10:16:48.790893+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/TTDUZDPM2DMXWV24VGECXKLVSV","json":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV.json","graph_json":"https://pith.science/api/pith-number/TTDUZDPM2DMXWV24VGECXKLVSV/graph.json","events_json":"https://pith.science/api/pith-number/TTDUZDPM2DMXWV24VGECXKLVSV/events.json","paper":"https://pith.science/paper/TTDUZDPM"},"agent_actions":{"view_html":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV","download_json":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV.json","view_paper":"https://pith.science/paper/TTDUZDPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.13536&json=true","fetch_graph":"https://pith.science/api/pith-number/TTDUZDPM2DMXWV24VGECXKLVSV/graph.json","fetch_events":"https://pith.science/api/pith-number/TTDUZDPM2DMXWV24VGECXKLVSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV/action/storage_attestation","attest_author":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV/action/author_attestation","sign_citation":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV/action/citation_signature","submit_replication":"https://pith.science/pith/TTDUZDPM2DMXWV24VGECXKLVSV/action/replication_record"}},"created_at":"2026-07-05T10:16:48.790893+00:00","updated_at":"2026-07-05T10:16:48.790893+00:00"}