{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GD62J3XPJFIZW3SVHGL5XW7MRX","short_pith_number":"pith:GD62J3XP","schema_version":"1.0","canonical_sha256":"30fda4eeef49519b6e553997dbdbec8ddb7021d28156cd3dbb3742859426d9ef","source":{"kind":"arxiv","id":"2507.07283","version":2},"attestation_state":"computed","paper":{"title":"Nonogram: Complexity of Inference and Phase Transition Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Foote, Danny Krizanc","submitted_at":"2025-07-09T21:07:31Z","abstract_excerpt":"Nonogram is a popular combinatorial puzzle (similar in nature to Sudoku or Minesweeper) in which a puzzle solver must determine if there exists a setting of the puzzle parameters that satisfy a given set of constraints. It has long been known that the problem of deciding if a solution exists is a computationally difficult problem. Despite this fact, humans still seem to enjoy playing it. This work aims to reconcile these seemingly contradictory facts by (1) analyzing the complexity of the inference problem for Nonogram (the problem of determining if there exists a puzzle parameter that can be "},"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":"2507.07283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-07-09T21:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"079a7eb21ff051593432c36832db487c62fef9152e4a61e4deea8ad080ba929b","abstract_canon_sha256":"dd332d0da1e707aa7809f0b281c13cf20e740168112048c0fb8325ec66f7919f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:21.376250Z","signature_b64":"eNNB/+BDYguLLf/0cOQwb06/TWkrT0j+H/LOozcbKnkbtXNxhJz076y6AdfUjctDTIDEM09rVLqu9V5rnY03Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30fda4eeef49519b6e553997dbdbec8ddb7021d28156cd3dbb3742859426d9ef","last_reissued_at":"2026-07-05T12:09:21.375703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:21.375703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonogram: Complexity of Inference and Phase Transition Behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Foote, Danny Krizanc","submitted_at":"2025-07-09T21:07:31Z","abstract_excerpt":"Nonogram is a popular combinatorial puzzle (similar in nature to Sudoku or Minesweeper) in which a puzzle solver must determine if there exists a setting of the puzzle parameters that satisfy a given set of constraints. It has long been known that the problem of deciding if a solution exists is a computationally difficult problem. Despite this fact, humans still seem to enjoy playing it. This work aims to reconcile these seemingly contradictory facts by (1) analyzing the complexity of the inference problem for Nonogram (the problem of determining if there exists a puzzle parameter that can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.07283","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.07283/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":"2507.07283","created_at":"2026-07-05T12:09:21.375764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.07283v2","created_at":"2026-07-05T12:09:21.375764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.07283","created_at":"2026-07-05T12:09:21.375764+00:00"},{"alias_kind":"pith_short_12","alias_value":"GD62J3XPJFIZ","created_at":"2026-07-05T12:09:21.375764+00:00"},{"alias_kind":"pith_short_16","alias_value":"GD62J3XPJFIZW3SV","created_at":"2026-07-05T12:09:21.375764+00:00"},{"alias_kind":"pith_short_8","alias_value":"GD62J3XP","created_at":"2026-07-05T12:09:21.375764+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/GD62J3XPJFIZW3SVHGL5XW7MRX","json":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX.json","graph_json":"https://pith.science/api/pith-number/GD62J3XPJFIZW3SVHGL5XW7MRX/graph.json","events_json":"https://pith.science/api/pith-number/GD62J3XPJFIZW3SVHGL5XW7MRX/events.json","paper":"https://pith.science/paper/GD62J3XP"},"agent_actions":{"view_html":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX","download_json":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX.json","view_paper":"https://pith.science/paper/GD62J3XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.07283&json=true","fetch_graph":"https://pith.science/api/pith-number/GD62J3XPJFIZW3SVHGL5XW7MRX/graph.json","fetch_events":"https://pith.science/api/pith-number/GD62J3XPJFIZW3SVHGL5XW7MRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX/action/storage_attestation","attest_author":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX/action/author_attestation","sign_citation":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX/action/citation_signature","submit_replication":"https://pith.science/pith/GD62J3XPJFIZW3SVHGL5XW7MRX/action/replication_record"}},"created_at":"2026-07-05T12:09:21.375764+00:00","updated_at":"2026-07-05T12:09:21.375764+00:00"}