{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:NPJY5SCEVSSYG3ISAG47IR3AV3","short_pith_number":"pith:NPJY5SCE","schema_version":"1.0","canonical_sha256":"6bd38ec844aca5836d1201b9f44760aed38dd83c4c5b0cf75e3f974f1276e442","source":{"kind":"arxiv","id":"0907.3188","version":2},"attestation_state":"computed","paper":{"title":"Enumeration of $4 \\times 4$ Magic Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Van Herick, Matthias Beck","submitted_at":"2009-07-18T07:54:03Z","abstract_excerpt":"A \\emph{magic square} is an $n \\times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the $n=3$ case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane arrangements and Ehrhart's theory of lattice-point enumeration."},"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":"0907.3188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-07-18T07:54:03Z","cross_cats_sorted":[],"title_canon_sha256":"0c82033efe5babcc56e03fee9313d6afbc1d18a7b80e2ae368abd1fa2b18258d","abstract_canon_sha256":"61ceb1fd27dd3ab4da0aa9791d49a22d4988f97b225ca97b89b93b8cf433dda4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:25.677001Z","signature_b64":"iKtcUFz/JkvHY+HNLMt/NDfBewrQBjkQAcN+eZCS8hs1xXYHoIqoDI9HJowcDW0iAFLDFpU2Fgkh8QHZQ7xIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bd38ec844aca5836d1201b9f44760aed38dd83c4c5b0cf75e3f974f1276e442","last_reissued_at":"2026-05-18T04:27:25.676383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:25.676383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of $4 \\times 4$ Magic Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Van Herick, Matthias Beck","submitted_at":"2009-07-18T07:54:03Z","abstract_excerpt":"A \\emph{magic square} is an $n \\times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an upper bound on the entries. The previous record for both functions was the $n=3$ case. Our methods are based on inside-out polytopes, i.e., the combination of hyperplane arrangements and Ehrhart's theory of lattice-point enumeration."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.3188","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":""},"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":"0907.3188","created_at":"2026-05-18T04:27:25.676474+00:00"},{"alias_kind":"arxiv_version","alias_value":"0907.3188v2","created_at":"2026-05-18T04:27:25.676474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.3188","created_at":"2026-05-18T04:27:25.676474+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPJY5SCEVSSY","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPJY5SCEVSSYG3IS","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPJY5SCE","created_at":"2026-05-18T12:26:00.592388+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/NPJY5SCEVSSYG3ISAG47IR3AV3","json":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3.json","graph_json":"https://pith.science/api/pith-number/NPJY5SCEVSSYG3ISAG47IR3AV3/graph.json","events_json":"https://pith.science/api/pith-number/NPJY5SCEVSSYG3ISAG47IR3AV3/events.json","paper":"https://pith.science/paper/NPJY5SCE"},"agent_actions":{"view_html":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3","download_json":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3.json","view_paper":"https://pith.science/paper/NPJY5SCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0907.3188&json=true","fetch_graph":"https://pith.science/api/pith-number/NPJY5SCEVSSYG3ISAG47IR3AV3/graph.json","fetch_events":"https://pith.science/api/pith-number/NPJY5SCEVSSYG3ISAG47IR3AV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3/action/storage_attestation","attest_author":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3/action/author_attestation","sign_citation":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3/action/citation_signature","submit_replication":"https://pith.science/pith/NPJY5SCEVSSYG3ISAG47IR3AV3/action/replication_record"}},"created_at":"2026-05-18T04:27:25.676474+00:00","updated_at":"2026-05-18T04:27:25.676474+00:00"}