{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SIYNPJXQXYNV7KNKV6ZUINKNM5","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":"4f03ef28c931aff4e6f38ec78fff0f54319f0e5ca21b44412ef348ac00b7ea62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-20T10:40:32Z","title_canon_sha256":"362eae3c3270f4752522537e979334ec2353c8d515180acab90975ac8be188ad"},"schema_version":"1.0","source":{"id":"1706.09389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09389","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09389v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09389","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"SIYNPJXQXYNV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SIYNPJXQXYNV7KNK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SIYNPJXQ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:2a972ccbc3a934f4e1ae9bdc4652db50d6531182c4712709a24e0ab24fa0932d","target":"graph","created_at":"2026-05-18T00:41:18Z","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":"This paper explores special arrangements of clues in $m \\times n$ Numbrix puzzles. The maximum number of clues which fails to define an $m \\times n$ puzzle is demonstrated for all $m$ and $n$. In addition, a small upper bound on the minimum number of clues required to define an $m \\times n$ puzzle is given for all $m$ and $n$ as well. For small $m \\geq 3$ our upper bound appears to actually give the minimum number and hence we conjecture that our bound may be sharp for all $m \\geq 3$.","authors_text":"David A. Nash, Mary Grace Hanson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-20T10:40:32Z","title":"Minimal and maximal Numbrix puzzles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09389","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:d0fb734d2ca94739bd218dd0174974ace3c78563f92cdaff5f9f8cbd8464cebc","target":"record","created_at":"2026-05-18T00:41:18Z","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":"4f03ef28c931aff4e6f38ec78fff0f54319f0e5ca21b44412ef348ac00b7ea62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-20T10:40:32Z","title_canon_sha256":"362eae3c3270f4752522537e979334ec2353c8d515180acab90975ac8be188ad"},"schema_version":"1.0","source":{"id":"1706.09389","kind":"arxiv","version":1}},"canonical_sha256":"9230d7a6f0be1b5fa9aaafb344354d67624366dda0538a82e7e42bb7af1eafb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9230d7a6f0be1b5fa9aaafb344354d67624366dda0538a82e7e42bb7af1eafb0","first_computed_at":"2026-05-18T00:41:18.786438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:18.786438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TnzzaA8iwTpCkZ576O83zupQYIeKBMrrXek6ImP169E/Pi70Mf7FVhzVEts5BXb4oq3jzM5f3YNC1cMjdyp7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:18.787226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0fb734d2ca94739bd218dd0174974ace3c78563f92cdaff5f9f8cbd8464cebc","sha256:2a972ccbc3a934f4e1ae9bdc4652db50d6531182c4712709a24e0ab24fa0932d"],"state_sha256":"b51723e6bfa23da2e50300c276ad7d7eda6a9f8e838a9a898a6cff228cd4e510"}