{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HACLFPMPGWZ45E7T64ZVWEUFNC","short_pith_number":"pith:HACLFPMP","canonical_record":{"source":{"id":"2412.12466","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T01:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"681d66946583fc29503da3530400e6e0ec76e0c26f0daf629dc6c3a64b312e72","abstract_canon_sha256":"81751e23495af585fb4d43a28909d9249625190d8d1b630126057a27d668b604"},"schema_version":"1.0"},"canonical_sha256":"3804b2bd8f35b3ce93f3f7335b128568864be58c46225622a491c57100dcc4b4","source":{"kind":"arxiv","id":"2412.12466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12466","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12466v1","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12466","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"pith_short_12","alias_value":"HACLFPMPGWZ4","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"pith_short_16","alias_value":"HACLFPMPGWZ45E7T","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"pith_short_8","alias_value":"HACLFPMP","created_at":"2026-07-05T09:50:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HACLFPMPGWZ45E7T64ZVWEUFNC","target":"record","payload":{"canonical_record":{"source":{"id":"2412.12466","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T01:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"681d66946583fc29503da3530400e6e0ec76e0c26f0daf629dc6c3a64b312e72","abstract_canon_sha256":"81751e23495af585fb4d43a28909d9249625190d8d1b630126057a27d668b604"},"schema_version":"1.0"},"canonical_sha256":"3804b2bd8f35b3ce93f3f7335b128568864be58c46225622a491c57100dcc4b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:15.311768Z","signature_b64":"nOWVEqnteWIf8ngOcu3AEFVrBKG/R6CFekNfGHBnjMALpJpnDKGJGOfB4OnmMUNxbFk09mekFO3pZx8dXhMtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3804b2bd8f35b3ce93f3f7335b128568864be58c46225622a491c57100dcc4b4","last_reissued_at":"2026-07-05T09:50:15.311303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:15.311303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.12466","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-07-05T09:50:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJF0m2cAPiBs1BnLyd1N16n+ofjonf6MjQspc9nOIxKlzo+GaxAhlLtSwzJ954qOlj6k2bMHAYLfj9rkg5lBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:49:05.401822Z"},"content_sha256":"57a1cfa1fca003ac8eb39a8d8be5e6d3605cb0fa40b6d3b9ae95526144ee323d","schema_version":"1.0","event_id":"sha256:57a1cfa1fca003ac8eb39a8d8be5e6d3605cb0fa40b6d3b9ae95526144ee323d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HACLFPMPGWZ45E7T64ZVWEUFNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Latin Squares whose transversals share many entries","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afsane Ghafari, Ian M. Wanless","submitted_at":"2024-12-17T01:58:57Z","abstract_excerpt":"We prove that, for all even $n\\geq10$, there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $ \\big\\lfloor n/6 \\big\\rfloor$ entries. These latin squares have at least $ 19 n^2/36 + O(n)$ transversal-free entries. We also prove that for all odd $m\\geq 3$, there exists a latin square of order $n=3m$ divided into nine $m\\times m$ subsquares, where every transversal hits each of these subsquares at least once."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12466","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.12466/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:50:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egBNCkXXzxmCbwiAa9TJSgqunHt7WXiEPgAO6vjjrIw4NPMxvXU7SHjy1wtZuJiSiUUaJiLUCGn4uAA5TTleAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:49:05.402358Z"},"content_sha256":"1ebdbecaf25e8838d5611f0f8cb8f470a76833dd047536114ef162f3a4144946","schema_version":"1.0","event_id":"sha256:1ebdbecaf25e8838d5611f0f8cb8f470a76833dd047536114ef162f3a4144946"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HACLFPMPGWZ45E7T64ZVWEUFNC/bundle.json","state_url":"https://pith.science/pith/HACLFPMPGWZ45E7T64ZVWEUFNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HACLFPMPGWZ45E7T64ZVWEUFNC/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-08-20T20:49:05Z","links":{"resolver":"https://pith.science/pith/HACLFPMPGWZ45E7T64ZVWEUFNC","bundle":"https://pith.science/pith/HACLFPMPGWZ45E7T64ZVWEUFNC/bundle.json","state":"https://pith.science/pith/HACLFPMPGWZ45E7T64ZVWEUFNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HACLFPMPGWZ45E7T64ZVWEUFNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HACLFPMPGWZ45E7T64ZVWEUFNC","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":"81751e23495af585fb4d43a28909d9249625190d8d1b630126057a27d668b604","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T01:58:57Z","title_canon_sha256":"681d66946583fc29503da3530400e6e0ec76e0c26f0daf629dc6c3a64b312e72"},"schema_version":"1.0","source":{"id":"2412.12466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12466","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12466v1","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12466","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"pith_short_12","alias_value":"HACLFPMPGWZ4","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"pith_short_16","alias_value":"HACLFPMPGWZ45E7T","created_at":"2026-07-05T09:50:15Z"},{"alias_kind":"pith_short_8","alias_value":"HACLFPMP","created_at":"2026-07-05T09:50:15Z"}],"graph_snapshots":[{"event_id":"sha256:1ebdbecaf25e8838d5611f0f8cb8f470a76833dd047536114ef162f3a4144946","target":"graph","created_at":"2026-07-05T09:50:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.12466/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that, for all even $n\\geq10$, there exists a latin square of order $n$ with at least one transversal, yet all transversals coincide on $ \\big\\lfloor n/6 \\big\\rfloor$ entries. These latin squares have at least $ 19 n^2/36 + O(n)$ transversal-free entries. We also prove that for all odd $m\\geq 3$, there exists a latin square of order $n=3m$ divided into nine $m\\times m$ subsquares, where every transversal hits each of these subsquares at least once.","authors_text":"Afsane Ghafari, Ian M. Wanless","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T01:58:57Z","title":"Latin Squares whose transversals share many entries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12466","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:57a1cfa1fca003ac8eb39a8d8be5e6d3605cb0fa40b6d3b9ae95526144ee323d","target":"record","created_at":"2026-07-05T09:50:15Z","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":"81751e23495af585fb4d43a28909d9249625190d8d1b630126057a27d668b604","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-17T01:58:57Z","title_canon_sha256":"681d66946583fc29503da3530400e6e0ec76e0c26f0daf629dc6c3a64b312e72"},"schema_version":"1.0","source":{"id":"2412.12466","kind":"arxiv","version":1}},"canonical_sha256":"3804b2bd8f35b3ce93f3f7335b128568864be58c46225622a491c57100dcc4b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3804b2bd8f35b3ce93f3f7335b128568864be58c46225622a491c57100dcc4b4","first_computed_at":"2026-07-05T09:50:15.311303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:15.311303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nOWVEqnteWIf8ngOcu3AEFVrBKG/R6CFekNfGHBnjMALpJpnDKGJGOfB4OnmMUNxbFk09mekFO3pZx8dXhMtCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:15.311768Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.12466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57a1cfa1fca003ac8eb39a8d8be5e6d3605cb0fa40b6d3b9ae95526144ee323d","sha256:1ebdbecaf25e8838d5611f0f8cb8f470a76833dd047536114ef162f3a4144946"],"state_sha256":"5855da2247068d8eac6ed56a0ec8e495357e869298a41764c3148b7fabd321da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RngtDydaIclflNiN9t6uiMgpRn5hOv1k6MDAwsAHydkE7OyRUE+qz5hhJo6y6WSjhosgQy4M3RBcnSlxdbofBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T20:49:05.406092Z","bundle_sha256":"dea2a3481c2349552c0c766c4dd10a76db7258bc834bf66e96ac6d91388f73db"}}