{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FKU74YY2LDF4H3TUVYTUUEBOIN","short_pith_number":"pith:FKU74YY2","schema_version":"1.0","canonical_sha256":"2aa9fe631a58cbc3ee74ae274a102e43637a4ef525e3a2f432f8cb2509354d3e","source":{"kind":"arxiv","id":"1808.02588","version":1},"attestation_state":"computed","paper":{"title":"The existence of square non-integer Heffter arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diane Donovan, Jeff Dinitz, Nicholas J. Cavenagh, Sule Yaz{\\i}c{\\i}","submitted_at":"2018-08-08T00:07:04Z","abstract_excerpt":"A Heffter array $H(n;k)$ is an $n\\times n$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\\leq x\\leq nk$. Heffter arrays are useful for embedding the graph $K_{2nk+1}$ on an orientable surface. An integer Heffter array is one in which each row and column sum is $0$. Necessary and sufficient conditions (on $n$ and $k$) for the existence of an integer Heffter array $H(n;k)$ were verified by Archdeacon, Dinitz, Donovan and Yaz\\i c\\i \\ (2015) and Dinitz and Wanless (2017)"},"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":"1808.02588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T00:07:04Z","cross_cats_sorted":[],"title_canon_sha256":"c14a54f3053a63d33fde000f57221916d6444ed94c975d991b62b1ad9228969d","abstract_canon_sha256":"cabe30c3e1d5c4833b472005a478f020cae1bbfd3fdf28b76899ff4a4990ef36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:34.903532Z","signature_b64":"UO5sfSN6fzu+wVVWK8T9csf/fZBGFGwt6oiAcNxC0/BSwbRbkFX6LGVTXr2MBF58oal5wyWVb5TGbXsb40BQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aa9fe631a58cbc3ee74ae274a102e43637a4ef525e3a2f432f8cb2509354d3e","last_reissued_at":"2026-05-18T00:08:34.902833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:34.902833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The existence of square non-integer Heffter arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diane Donovan, Jeff Dinitz, Nicholas J. Cavenagh, Sule Yaz{\\i}c{\\i}","submitted_at":"2018-08-08T00:07:04Z","abstract_excerpt":"A Heffter array $H(n;k)$ is an $n\\times n$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\\leq x\\leq nk$. Heffter arrays are useful for embedding the graph $K_{2nk+1}$ on an orientable surface. An integer Heffter array is one in which each row and column sum is $0$. Necessary and sufficient conditions (on $n$ and $k$) for the existence of an integer Heffter array $H(n;k)$ were verified by Archdeacon, Dinitz, Donovan and Yaz\\i c\\i \\ (2015) and Dinitz and Wanless (2017)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02588","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":"1808.02588","created_at":"2026-05-18T00:08:34.902939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02588v1","created_at":"2026-05-18T00:08:34.902939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02588","created_at":"2026-05-18T00:08:34.902939+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKU74YY2LDF4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKU74YY2LDF4H3TU","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKU74YY2","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/FKU74YY2LDF4H3TUVYTUUEBOIN","json":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN.json","graph_json":"https://pith.science/api/pith-number/FKU74YY2LDF4H3TUVYTUUEBOIN/graph.json","events_json":"https://pith.science/api/pith-number/FKU74YY2LDF4H3TUVYTUUEBOIN/events.json","paper":"https://pith.science/paper/FKU74YY2"},"agent_actions":{"view_html":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN","download_json":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN.json","view_paper":"https://pith.science/paper/FKU74YY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02588&json=true","fetch_graph":"https://pith.science/api/pith-number/FKU74YY2LDF4H3TUVYTUUEBOIN/graph.json","fetch_events":"https://pith.science/api/pith-number/FKU74YY2LDF4H3TUVYTUUEBOIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN/action/storage_attestation","attest_author":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN/action/author_attestation","sign_citation":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN/action/citation_signature","submit_replication":"https://pith.science/pith/FKU74YY2LDF4H3TUVYTUUEBOIN/action/replication_record"}},"created_at":"2026-05-18T00:08:34.902939+00:00","updated_at":"2026-05-18T00:08:34.902939+00:00"}