{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DDYBSGZYHCZ7XTN6NT7GAESEJ7","short_pith_number":"pith:DDYBSGZY","schema_version":"1.0","canonical_sha256":"18f0191b3838b3fbcdbe6cfe6012444fe2de64508c6efe57dd753ea052709131","source":{"kind":"arxiv","id":"1812.02219","version":1},"attestation_state":"computed","paper":{"title":"Finding a Unique Solution to Radon-Kaczmarz Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.HO"],"primary_cat":"math.CO","authors_text":"Steven Rossi, Xiao Xiao","submitted_at":"2018-12-05T20:51:54Z","abstract_excerpt":"Solving a Radon-Kaczmarz puzzle involves filling a square grid with positive integers, each between one and nine, satisfying certain clues coming from the sum of entries that lie on the same line in the square grid. Given a set of slopes (of a particular order) that define clues of Radon-Kaczmarz puzzles, we give an upper bound of the size such that any solvable Radon-Kaczmarz puzzle whose size is less than or equal to that is uniquely solvable."},"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":"1812.02219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-05T20:51:54Z","cross_cats_sorted":["math.HO"],"title_canon_sha256":"ce3a456158122bd1cded9020d564baf768a27e6652699f86bb88fde2d7b81750","abstract_canon_sha256":"47484c0514cbc1ce93d9eec97947979e063de12e7c6d63e508e19e1890336828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:56.865184Z","signature_b64":"LO6yXVuJS5SVSXIl7LjBEOp3fMPNVPoF6VG6r3VnfiB/PEqPEyYmjtLtlyuc3GaUtiFJ+SGo9gV/TSYav78BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18f0191b3838b3fbcdbe6cfe6012444fe2de64508c6efe57dd753ea052709131","last_reissued_at":"2026-05-17T23:58:56.864764Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:56.864764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a Unique Solution to Radon-Kaczmarz Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.HO"],"primary_cat":"math.CO","authors_text":"Steven Rossi, Xiao Xiao","submitted_at":"2018-12-05T20:51:54Z","abstract_excerpt":"Solving a Radon-Kaczmarz puzzle involves filling a square grid with positive integers, each between one and nine, satisfying certain clues coming from the sum of entries that lie on the same line in the square grid. Given a set of slopes (of a particular order) that define clues of Radon-Kaczmarz puzzles, we give an upper bound of the size such that any solvable Radon-Kaczmarz puzzle whose size is less than or equal to that is uniquely solvable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02219","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.02219","created_at":"2026-05-17T23:58:56.864829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02219v1","created_at":"2026-05-17T23:58:56.864829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02219","created_at":"2026-05-17T23:58:56.864829+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDYBSGZYHCZ7","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDYBSGZYHCZ7XTN6","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDYBSGZY","created_at":"2026-05-18T12:32:19.392346+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/DDYBSGZYHCZ7XTN6NT7GAESEJ7","json":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7.json","graph_json":"https://pith.science/api/pith-number/DDYBSGZYHCZ7XTN6NT7GAESEJ7/graph.json","events_json":"https://pith.science/api/pith-number/DDYBSGZYHCZ7XTN6NT7GAESEJ7/events.json","paper":"https://pith.science/paper/DDYBSGZY"},"agent_actions":{"view_html":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7","download_json":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7.json","view_paper":"https://pith.science/paper/DDYBSGZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02219&json=true","fetch_graph":"https://pith.science/api/pith-number/DDYBSGZYHCZ7XTN6NT7GAESEJ7/graph.json","fetch_events":"https://pith.science/api/pith-number/DDYBSGZYHCZ7XTN6NT7GAESEJ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7/action/storage_attestation","attest_author":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7/action/author_attestation","sign_citation":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7/action/citation_signature","submit_replication":"https://pith.science/pith/DDYBSGZYHCZ7XTN6NT7GAESEJ7/action/replication_record"}},"created_at":"2026-05-17T23:58:56.864829+00:00","updated_at":"2026-05-17T23:58:56.864829+00:00"}