{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CQIUIFNYDXV2PYCTMI7PADFP45","short_pith_number":"pith:CQIUIFNY","schema_version":"1.0","canonical_sha256":"14114415b81deba7e053623ef00cafe757db07ccc565a3f10eb570e25c6c8d76","source":{"kind":"arxiv","id":"1009.1373","version":1},"attestation_state":"computed","paper":{"title":"Generalized Semimagic Squares for Digital Halftoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Akitoshi Kawamura","submitted_at":"2010-09-07T19:23:51Z","abstract_excerpt":"Completing Aronov et al.'s study on zero-discrepancy matrices for digital halftoning, we determine all (m, n, k, l) for which it is possible to put mn consecutive integers on an m-by-n board (with wrap-around) so that each k-by-l region holds the same sum. For one of the cases where this is impossible, we give a heuristic method to find a matrix with small discrepancy."},"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":"1009.1373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-09-07T19:23:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"06e7a207451fe30b922cb3b291f693399a93df4555021d9ae53772ec06beaa5e","abstract_canon_sha256":"15e000cee33deac3ac2914dab2a7a4ff68a2c19fe79446a64aac909898ab8ac1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.140018Z","signature_b64":"oIKU/qz2a7gpruhI2WsP2yj5yPPPNeRnTOwIQzcxo5+tfzyggcC81WJFUo3t8u4CWf5TpmHf2Q95wlk67BU6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14114415b81deba7e053623ef00cafe757db07ccc565a3f10eb570e25c6c8d76","last_reissued_at":"2026-05-18T03:26:40.139473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.139473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Semimagic Squares for Digital Halftoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Akitoshi Kawamura","submitted_at":"2010-09-07T19:23:51Z","abstract_excerpt":"Completing Aronov et al.'s study on zero-discrepancy matrices for digital halftoning, we determine all (m, n, k, l) for which it is possible to put mn consecutive integers on an m-by-n board (with wrap-around) so that each k-by-l region holds the same sum. For one of the cases where this is impossible, we give a heuristic method to find a matrix with small discrepancy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1373","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":"1009.1373","created_at":"2026-05-18T03:26:40.139548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1373v1","created_at":"2026-05-18T03:26:40.139548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1373","created_at":"2026-05-18T03:26:40.139548+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQIUIFNYDXV2","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQIUIFNYDXV2PYCT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQIUIFNY","created_at":"2026-05-18T12:26:06.534383+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/CQIUIFNYDXV2PYCTMI7PADFP45","json":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45.json","graph_json":"https://pith.science/api/pith-number/CQIUIFNYDXV2PYCTMI7PADFP45/graph.json","events_json":"https://pith.science/api/pith-number/CQIUIFNYDXV2PYCTMI7PADFP45/events.json","paper":"https://pith.science/paper/CQIUIFNY"},"agent_actions":{"view_html":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45","download_json":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45.json","view_paper":"https://pith.science/paper/CQIUIFNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1373&json=true","fetch_graph":"https://pith.science/api/pith-number/CQIUIFNYDXV2PYCTMI7PADFP45/graph.json","fetch_events":"https://pith.science/api/pith-number/CQIUIFNYDXV2PYCTMI7PADFP45/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45/action/storage_attestation","attest_author":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45/action/author_attestation","sign_citation":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45/action/citation_signature","submit_replication":"https://pith.science/pith/CQIUIFNYDXV2PYCTMI7PADFP45/action/replication_record"}},"created_at":"2026-05-18T03:26:40.139548+00:00","updated_at":"2026-05-18T03:26:40.139548+00:00"}