{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CNN6AM27VVMZPMZGOK432PEJBW","short_pith_number":"pith:CNN6AM27","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"},"canonical_sha256":"135be0335fad5997b32672b9bd3c890daaf0f3ddd8ec776d435dcd0726022f25","source":{"kind":"arxiv","id":"2607.17547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17547","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17547v1","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17547","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"CNN6AM27VVMZ","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"pith_short_16","alias_value":"CNN6AM27VVMZPMZG","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"pith_short_8","alias_value":"CNN6AM27","created_at":"2026-07-21T01:21:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CNN6AM27VVMZPMZGOK432PEJBW","target":"record","payload":{"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"},"canonical_sha256":"135be0335fad5997b32672b9bd3c890daaf0f3ddd8ec776d435dcd0726022f25","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"},"source_kind":"arxiv","source_id":"2607.17547","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-21T01:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/30osQhMslozYgaB5/t5Nl/5LPse4ISQzLDK2u/S0ZlGJ0JdcJamV19Hh/GqCKT5Fki4awwEgoml1utOZ5JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:01:14.596900Z"},"content_sha256":"53df6ff133a539f1216421614a0228fd74ccae5f4eaa6b0bb44abde457fc9aed","schema_version":"1.0","event_id":"sha256:53df6ff133a539f1216421614a0228fd74ccae5f4eaa6b0bb44abde457fc9aed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CNN6AM27VVMZPMZGOK432PEJBW","target":"graph","payload":{"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"},"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-21T01:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mcHSw0QKWgvps2g9eOqJdewIjoyELXur25s2hmEIbwg0DrWgwMxRg0XThHLcVY6HGR/5xfhP9X0knLadN8BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:01:14.597431Z"},"content_sha256":"718a24b838e62d2dde997eef591f806935c9f98d0a1679ab445f03812399f22f","schema_version":"1.0","event_id":"sha256:718a24b838e62d2dde997eef591f806935c9f98d0a1679ab445f03812399f22f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/bundle.json","state_url":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNN6AM27VVMZPMZGOK432PEJBW/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-08T15:01:14Z","links":{"resolver":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW","bundle":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/bundle.json","state":"https://pith.science/pith/CNN6AM27VVMZPMZGOK432PEJBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNN6AM27VVMZPMZGOK432PEJBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CNN6AM27VVMZPMZGOK432PEJBW","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":"119749d9c0b2fe9486939f05abf0df46ea676894b6864781ebf67579c2bdd450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-20T04:46:09Z","title_canon_sha256":"4f221ddd8ca44f05e2e5be45729d1c5d8731dce4840820a8179d68b6f316893d"},"schema_version":"1.0","source":{"id":"2607.17547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.17547","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"2607.17547v1","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.17547","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"CNN6AM27VVMZ","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"pith_short_16","alias_value":"CNN6AM27VVMZPMZG","created_at":"2026-07-21T01:21:51Z"},{"alias_kind":"pith_short_8","alias_value":"CNN6AM27","created_at":"2026-07-21T01:21:51Z"}],"graph_snapshots":[{"event_id":"sha256:718a24b838e62d2dde997eef591f806935c9f98d0a1679ab445f03812399f22f","target":"graph","created_at":"2026-07-21T01:21:51Z","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/2607.17547/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Afsane Ghafari, Ian M. Wanless","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-20T04:46:09Z","title":"Latin Squares whose transversals intersect in unusual ways"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.17547","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:53df6ff133a539f1216421614a0228fd74ccae5f4eaa6b0bb44abde457fc9aed","target":"record","created_at":"2026-07-21T01:21:51Z","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":"119749d9c0b2fe9486939f05abf0df46ea676894b6864781ebf67579c2bdd450","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-20T04:46:09Z","title_canon_sha256":"4f221ddd8ca44f05e2e5be45729d1c5d8731dce4840820a8179d68b6f316893d"},"schema_version":"1.0","source":{"id":"2607.17547","kind":"arxiv","version":1}},"canonical_sha256":"135be0335fad5997b32672b9bd3c890daaf0f3ddd8ec776d435dcd0726022f25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"135be0335fad5997b32672b9bd3c890daaf0f3ddd8ec776d435dcd0726022f25","first_computed_at":"2026-07-21T01:21:51.696783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-21T01:21:51.696783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozOO1bmepJ5OAhxmq3eBZNaKepxy9sQVIfNzasTRig3HuKUFXoSIAat/f/5CcIEfoV0UJCG5Lwyj55MaZwHMDQ==","signature_status":"signed_v1","signed_at":"2026-07-21T01:21:51.697621Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.17547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53df6ff133a539f1216421614a0228fd74ccae5f4eaa6b0bb44abde457fc9aed","sha256:718a24b838e62d2dde997eef591f806935c9f98d0a1679ab445f03812399f22f"],"state_sha256":"64097fbeeee184bbf409528031390ce2c8a1ffb2a419b24c52c4d7d9a21bcb1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gu15UPnl1XTUrhUZ4N7OV/MBaWGoI1xARs5Beg6/Xv5qWFGth89YX2a8Gg3iT8N5+dXHll6X4J4Yf6EaqtZ8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:01:14.601355Z","bundle_sha256":"6b4edfa08b82919aa8a7cad599d8382fbc34d892a2972e29bf5aeec5163986c6"}}