{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PX45QN7NXYVHNJWOGVV5V54AY7","short_pith_number":"pith:PX45QN7N","canonical_record":{"source":{"id":"1509.00430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T18:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"8b59e058d99bc5fc4ff7cc1ab3a3e7e9d765fae12bed9746e8004a3482731d17","abstract_canon_sha256":"e0e8f1404e81882bfac8d77599e55f41aafd17f4da24d1d76228e30a6b07e798"},"schema_version":"1.0"},"canonical_sha256":"7df9d837edbe2a76a6ce356bdaf780c7dc0478bb98177df90ea69aa7bc163337","source":{"kind":"arxiv","id":"1509.00430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00430","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00430v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00430","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"PX45QN7NXYVH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PX45QN7NXYVHNJWO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PX45QN7N","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PX45QN7NXYVHNJWOGVV5V54AY7","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T18:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"8b59e058d99bc5fc4ff7cc1ab3a3e7e9d765fae12bed9746e8004a3482731d17","abstract_canon_sha256":"e0e8f1404e81882bfac8d77599e55f41aafd17f4da24d1d76228e30a6b07e798"},"schema_version":"1.0"},"canonical_sha256":"7df9d837edbe2a76a6ce356bdaf780c7dc0478bb98177df90ea69aa7bc163337","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.110600Z","signature_b64":"cPMjoXLp7fhr4BBgf0WKK8vC5sHzzbRDsSP6FtwFvAEp2DlvJUmJc5IJql6o1kvOJeg/LNwt7i4ChUfLOBMECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7df9d837edbe2a76a6ce356bdaf780c7dc0478bb98177df90ea69aa7bc163337","last_reissued_at":"2026-05-18T01:34:14.109833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.109833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00430","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iPMs1PFSc/m39CLnAiS/OcabL0UoSbMp4U2T0UNtvtHGouvg3xT+8Xp9QB+dX5dclN5e9z/z59g2PTtJRez1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:21:20.796862Z"},"content_sha256":"f6c19437ee5ec3230e59ce81fa7145b07175863f5d39d61e5d4e5477f61f1b2f","schema_version":"1.0","event_id":"sha256:f6c19437ee5ec3230e59ce81fa7145b07175863f5d39d61e5d4e5477f61f1b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PX45QN7NXYVHNJWOGVV5V54AY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Heffter Arrays Exist for all Possible Values: The Research Report","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan S. Archdeacon, Jeffrey H. Dinitz, Tomas Boothby","submitted_at":"2015-09-01T18:28:10Z","abstract_excerpt":"A tight Heffter array H(m,n) is an m x n matrix with nonzero entries from Z_{2mn+1} such that i) the sum of the elements in each row and each column is 0, and ii) no element from {x,-x\\ appears twice. We prove that H(m,n) exist if and only if both m and n are at least 3. If all entries are integers of magnitude at most mn satisfying every row and column sum is 0 over the integers and also satisfying ii) we call H an integer Heffter array. We show integer Heffter arrays exist if and only if mn \\equiv 0,3 (mod 4). Finally, an integer Heffter array is shiftable if each row and column contains an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00430","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qR5OV20cYJ49JKwnRhrU6sdO1J4NI8oQ57yvdyBdFuaskWSTnUoQ9Zi1uz2gf0hrLjv5V4hyNXNvJLOGsd/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:21:20.797515Z"},"content_sha256":"94c08feea9a5ad39ecdf4372250098192c96b8f1516458289b487e09f2c48af5","schema_version":"1.0","event_id":"sha256:94c08feea9a5ad39ecdf4372250098192c96b8f1516458289b487e09f2c48af5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PX45QN7NXYVHNJWOGVV5V54AY7/bundle.json","state_url":"https://pith.science/pith/PX45QN7NXYVHNJWOGVV5V54AY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PX45QN7NXYVHNJWOGVV5V54AY7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T04:21:20Z","links":{"resolver":"https://pith.science/pith/PX45QN7NXYVHNJWOGVV5V54AY7","bundle":"https://pith.science/pith/PX45QN7NXYVHNJWOGVV5V54AY7/bundle.json","state":"https://pith.science/pith/PX45QN7NXYVHNJWOGVV5V54AY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PX45QN7NXYVHNJWOGVV5V54AY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PX45QN7NXYVHNJWOGVV5V54AY7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0e8f1404e81882bfac8d77599e55f41aafd17f4da24d1d76228e30a6b07e798","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T18:28:10Z","title_canon_sha256":"8b59e058d99bc5fc4ff7cc1ab3a3e7e9d765fae12bed9746e8004a3482731d17"},"schema_version":"1.0","source":{"id":"1509.00430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00430","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00430v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00430","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"PX45QN7NXYVH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PX45QN7NXYVHNJWO","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PX45QN7N","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:94c08feea9a5ad39ecdf4372250098192c96b8f1516458289b487e09f2c48af5","target":"graph","created_at":"2026-05-18T01:34:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A tight Heffter array H(m,n) is an m x n matrix with nonzero entries from Z_{2mn+1} such that i) the sum of the elements in each row and each column is 0, and ii) no element from {x,-x\\ appears twice. We prove that H(m,n) exist if and only if both m and n are at least 3. If all entries are integers of magnitude at most mn satisfying every row and column sum is 0 over the integers and also satisfying ii) we call H an integer Heffter array. We show integer Heffter arrays exist if and only if mn \\equiv 0,3 (mod 4). Finally, an integer Heffter array is shiftable if each row and column contains an ","authors_text":"Dan S. Archdeacon, Jeffrey H. Dinitz, Tomas Boothby","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T18:28:10Z","title":"Tight Heffter Arrays Exist for all Possible Values: The Research Report"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00430","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6c19437ee5ec3230e59ce81fa7145b07175863f5d39d61e5d4e5477f61f1b2f","target":"record","created_at":"2026-05-18T01:34:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0e8f1404e81882bfac8d77599e55f41aafd17f4da24d1d76228e30a6b07e798","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T18:28:10Z","title_canon_sha256":"8b59e058d99bc5fc4ff7cc1ab3a3e7e9d765fae12bed9746e8004a3482731d17"},"schema_version":"1.0","source":{"id":"1509.00430","kind":"arxiv","version":1}},"canonical_sha256":"7df9d837edbe2a76a6ce356bdaf780c7dc0478bb98177df90ea69aa7bc163337","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7df9d837edbe2a76a6ce356bdaf780c7dc0478bb98177df90ea69aa7bc163337","first_computed_at":"2026-05-18T01:34:14.109833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:14.109833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPMjoXLp7fhr4BBgf0WKK8vC5sHzzbRDsSP6FtwFvAEp2DlvJUmJc5IJql6o1kvOJeg/LNwt7i4ChUfLOBMECw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:14.110600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6c19437ee5ec3230e59ce81fa7145b07175863f5d39d61e5d4e5477f61f1b2f","sha256:94c08feea9a5ad39ecdf4372250098192c96b8f1516458289b487e09f2c48af5"],"state_sha256":"07d6205265cbccb8026c05fa4e5e99bcd6a0a27f5535d6a23f5d5235f59882a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"efaCCZk7iEz6pu40AMtKGDC3pAXMZKos7daZZNhrYsgHp21wEyJLEbnoBd7urDT8f18QT70a3bT2G+QJAG99Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:21:20.800904Z","bundle_sha256":"aa04bbb852f85be5cfb27a7f7535610fc65f6d5edc46c29bee9f27c2a23458e5"}}