{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P3P3UC6KZUL6HE5VDIUAPDL75I","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":"71cea2f04ae1ca35568a0072c965acc10d649cc7a88de05d417b3c97f352cb32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T06:33:06Z","title_canon_sha256":"e569e4d2c8d2f1e3ae86a7d8dc7c786bd5433d87ce5a6cd4fe271e538410788e"},"schema_version":"1.0","source":{"id":"2605.28027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28027","created_at":"2026-05-28T01:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28027v1","created_at":"2026-05-28T01:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28027","created_at":"2026-05-28T01:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"P3P3UC6KZUL6","created_at":"2026-05-28T01:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"P3P3UC6KZUL6HE5V","created_at":"2026-05-28T01:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"P3P3UC6K","created_at":"2026-05-28T01:04:56Z"}],"graph_snapshots":[{"event_id":"sha256:d8ae048f10782b857a02fe9fcb25313fa0c8705f5b7a17205d5fc8ca3e2b4789","target":"graph","created_at":"2026-05-28T01:04:56Z","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/2605.28027/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A defining set of a Latin square is a partially filled-in Latin square which completes to no other Latin square of the same order. We introduce the concept of a $k$-strong defining set, in which if less than $k$ entries are deleted, the property of being a defining set is retained. Equivalently, a $k$-strong defining set intersects every Latin trade in the Latin square at least $k$ times. In the addition table for integers modulo $n$, when $n$ is even we determine the minimum size of a $k$-strong defining set for any $k$. For odd $n$ we give a construction for a minimally $2$-strong defining s","authors_text":"Nicholas Cavenagh, Richard Bean","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T06:33:06Z","title":"Defining sets which intersect each Latin trade at least twice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28027","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:50dc6b50e0caf2f9b73bb9a0ffe2775f62b3e67727442f445723ca08b259d024","target":"record","created_at":"2026-05-28T01:04:56Z","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":"71cea2f04ae1ca35568a0072c965acc10d649cc7a88de05d417b3c97f352cb32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T06:33:06Z","title_canon_sha256":"e569e4d2c8d2f1e3ae86a7d8dc7c786bd5433d87ce5a6cd4fe271e538410788e"},"schema_version":"1.0","source":{"id":"2605.28027","kind":"arxiv","version":1}},"canonical_sha256":"7edfba0bcacd17e393b51a28078d7fea3376986e9072fb5313970ea060338433","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7edfba0bcacd17e393b51a28078d7fea3376986e9072fb5313970ea060338433","first_computed_at":"2026-05-28T01:04:56.398816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:56.398816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hPQJIdQnCGUaLlAn8b3UCIyrt4Quw3gGuPIu1o0UElTRLCnXouvGlAIjlaFseCh757TUNbeoDNx54RMpxdKCBA==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:56.399217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50dc6b50e0caf2f9b73bb9a0ffe2775f62b3e67727442f445723ca08b259d024","sha256:d8ae048f10782b857a02fe9fcb25313fa0c8705f5b7a17205d5fc8ca3e2b4789"],"state_sha256":"fce149f705b745622aee3c9afd983f1dded48b25aa5594c914bb005436c4f677"}