{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FESV6RT7DUEPOT4G4FI3DMN4YM","short_pith_number":"pith:FESV6RT7","schema_version":"1.0","canonical_sha256":"29255f467f1d08f74f86e151b1b1bcc33bf4d569f1c5db6070e7d1ace428bbd3","source":{"kind":"arxiv","id":"1804.11189","version":1},"attestation_state":"computed","paper":{"title":"Magic squares with empty cells","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdollah Khodkar, David Leach","submitted_at":"2018-04-30T13:44:58Z","abstract_excerpt":"A k-magic square of order n is an arrangement of the numbers from 0 to kn-1 in an n by n matrix, such that each row and each column has exactly k filled cells, each number occurs exactly once, and the sum of the entries of any row or any column is the same. A magic square is called k-diagonal if its entries all belong to k consecutive diagonals. In this paper we prove that a k-diagonal magic square exists if and only if n = k = 1 or 3 <= k <=n and n is odd or k is even."},"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":"1804.11189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-30T13:44:58Z","cross_cats_sorted":[],"title_canon_sha256":"4730e68d4f82c9aeb80a90e9a18d2f79d27b31d045eed5bd4699b7a99d999c71","abstract_canon_sha256":"54219fe6db350ec0746191a817ea1e7c2543fe694a41c7d7f5a002275f6d82d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:14.339957Z","signature_b64":"ihjTX2pLfyzSzff3yU0vQwMSS+7FOFdgRLyXqj4gvEUCSEujzb4D7ka064kRqmAtJp1pNaaankt6hQb7RmGrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29255f467f1d08f74f86e151b1b1bcc33bf4d569f1c5db6070e7d1ace428bbd3","last_reissued_at":"2026-05-18T00:17:14.339235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:14.339235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Magic squares with empty cells","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdollah Khodkar, David Leach","submitted_at":"2018-04-30T13:44:58Z","abstract_excerpt":"A k-magic square of order n is an arrangement of the numbers from 0 to kn-1 in an n by n matrix, such that each row and each column has exactly k filled cells, each number occurs exactly once, and the sum of the entries of any row or any column is the same. A magic square is called k-diagonal if its entries all belong to k consecutive diagonals. In this paper we prove that a k-diagonal magic square exists if and only if n = k = 1 or 3 <= k <=n and n is odd or k is even."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11189","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":"1804.11189","created_at":"2026-05-18T00:17:14.339349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11189v1","created_at":"2026-05-18T00:17:14.339349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11189","created_at":"2026-05-18T00:17:14.339349+00:00"},{"alias_kind":"pith_short_12","alias_value":"FESV6RT7DUEP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FESV6RT7DUEPOT4G","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FESV6RT7","created_at":"2026-05-18T12:32:22.470017+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/FESV6RT7DUEPOT4G4FI3DMN4YM","json":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM.json","graph_json":"https://pith.science/api/pith-number/FESV6RT7DUEPOT4G4FI3DMN4YM/graph.json","events_json":"https://pith.science/api/pith-number/FESV6RT7DUEPOT4G4FI3DMN4YM/events.json","paper":"https://pith.science/paper/FESV6RT7"},"agent_actions":{"view_html":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM","download_json":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM.json","view_paper":"https://pith.science/paper/FESV6RT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11189&json=true","fetch_graph":"https://pith.science/api/pith-number/FESV6RT7DUEPOT4G4FI3DMN4YM/graph.json","fetch_events":"https://pith.science/api/pith-number/FESV6RT7DUEPOT4G4FI3DMN4YM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM/action/storage_attestation","attest_author":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM/action/author_attestation","sign_citation":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM/action/citation_signature","submit_replication":"https://pith.science/pith/FESV6RT7DUEPOT4G4FI3DMN4YM/action/replication_record"}},"created_at":"2026-05-18T00:17:14.339349+00:00","updated_at":"2026-05-18T00:17:14.339349+00:00"}