{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CNN6AM27VVMZPMZGOK432PEJBW","short_pith_number":"pith:CNN6AM27","schema_version":"1.0","canonical_sha256":"135be0335fad5997b32672b9bd3c890daaf0f3ddd8ec776d435dcd0726022f25","source":{"kind":"arxiv","id":"2607.17547","version":1},"attestation_state":"computed","paper":{"title":"Latin Squares whose transversals intersect in unusual ways","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afsane Ghafari, Ian M. Wanless","submitted_at":"2026-07-20T04:46:09Z","abstract_excerpt":"A latin square of order $n$ is an $n\\times n$ array in which each of $n$ symbols occurs exactly once in each row and column. A transversal in such a square is a selection of $n$ entries that includes one representative of each row and column, and one of each symbol. For all even orders $n\\ge 28$ except $n=30$, we construct a latin square of order $n$ in which every pair of transversals share at least one entry. We conjecture that in our squares there is no single entry that is common to all transversals. We prove this conjecture for $n\\le10\\,000$ by finding transversals using an algorithm that"},"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":"2607.17547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-20T04:46:09Z","cross_cats_sorted":[],"title_canon_sha256":"4f221ddd8ca44f05e2e5be45729d1c5d8731dce4840820a8179d68b6f316893d","abstract_canon_sha256":"119749d9c0b2fe9486939f05abf0df46ea676894b6864781ebf67579c2bdd450"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-21T01:21:51.697621Z","signature_b64":"ozOO1bmepJ5OAhxmq3eBZNaKepxy9sQVIfNzasTRig3HuKUFXoSIAat/f/5CcIEfoV0UJCG5Lwyj55MaZwHMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"135be0335fad5997b32672b9bd3c890daaf0f3ddd8ec776d435dcd0726022f25","last_reissued_at":"2026-07-21T01:21:51.696783Z","signature_status":"signed_v1","first_computed_at":"2026-07-21T01:21:51.696783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latin Squares whose transversals intersect in unusual ways","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Afsane Ghafari, Ian M. Wanless","submitted_at":"2026-07-20T04:46:09Z","abstract_excerpt":"A latin square of order $n$ is an $n\\times n$ array in which each of $n$ symbols occurs exactly once in each row and column. A transversal in such a square is a selection of $n$ entries that includes one representative of each row and column, and one of each symbol. For all even orders $n\\ge 28$ except $n=30$, we construct a latin square of order $n$ in which every pair of transversals share at least one entry. We conjecture that in our squares there is no single entry that is common to all transversals. We prove this conjecture for $n\\le10\\,000$ by finding transversals using an algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17547","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/2607.17547/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.17547","created_at":"2026-07-21T01:21:51.697208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.17547v1","created_at":"2026-07-21T01:21:51.697208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17547","created_at":"2026-07-21T01:21:51.697208+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNN6AM27VVMZ","created_at":"2026-07-21T01:21:51.697208+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNN6AM27VVMZPMZG","created_at":"2026-07-21T01:21:51.697208+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNN6AM27","created_at":"2026-07-21T01:21:51.697208+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/CNN6AM27VVMZPMZGOK432PEJBW","json":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW.json","graph_json":"https://pith.science/api/pith-number/CNN6AM27VVMZPMZGOK432PEJBW/graph.json","events_json":"https://pith.science/api/pith-number/CNN6AM27VVMZPMZGOK432PEJBW/events.json","paper":"https://pith.science/paper/CNN6AM27"},"agent_actions":{"view_html":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW","download_json":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW.json","view_paper":"https://pith.science/paper/CNN6AM27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.17547&json=true","fetch_graph":"https://pith.science/api/pith-number/CNN6AM27VVMZPMZGOK432PEJBW/graph.json","fetch_events":"https://pith.science/api/pith-number/CNN6AM27VVMZPMZGOK432PEJBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/action/storage_attestation","attest_author":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/action/author_attestation","sign_citation":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/action/citation_signature","submit_replication":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/action/replication_record"}},"created_at":"2026-07-21T01:21:51.697208+00:00","updated_at":"2026-07-21T01:21:51.697208+00:00"}