{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:P3P3UC6KZUL6HE5VDIUAPDL75I","short_pith_number":"pith:P3P3UC6K","schema_version":"1.0","canonical_sha256":"7edfba0bcacd17e393b51a28078d7fea3376986e9072fb5313970ea060338433","source":{"kind":"arxiv","id":"2605.28027","version":1},"attestation_state":"computed","paper":{"title":"Defining sets which intersect each Latin trade at least twice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicholas Cavenagh, Richard Bean","submitted_at":"2026-05-27T06:33:06Z","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"},"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":"2605.28027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T06:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"e569e4d2c8d2f1e3ae86a7d8dc7c786bd5433d87ce5a6cd4fe271e538410788e","abstract_canon_sha256":"71cea2f04ae1ca35568a0072c965acc10d649cc7a88de05d417b3c97f352cb32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:56.399217Z","signature_b64":"hPQJIdQnCGUaLlAn8b3UCIyrt4Quw3gGuPIu1o0UElTRLCnXouvGlAIjlaFseCh757TUNbeoDNx54RMpxdKCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7edfba0bcacd17e393b51a28078d7fea3376986e9072fb5313970ea060338433","last_reissued_at":"2026-05-28T01:04:56.398816Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:56.398816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defining sets which intersect each Latin trade at least twice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicholas Cavenagh, Richard Bean","submitted_at":"2026-05-27T06:33:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28027","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/2605.28027/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":"2605.28027","created_at":"2026-05-28T01:04:56.398872+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28027v1","created_at":"2026-05-28T01:04:56.398872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28027","created_at":"2026-05-28T01:04:56.398872+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3P3UC6KZUL6","created_at":"2026-05-28T01:04:56.398872+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3P3UC6KZUL6HE5V","created_at":"2026-05-28T01:04:56.398872+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3P3UC6K","created_at":"2026-05-28T01:04:56.398872+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/P3P3UC6KZUL6HE5VDIUAPDL75I","json":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I.json","graph_json":"https://pith.science/api/pith-number/P3P3UC6KZUL6HE5VDIUAPDL75I/graph.json","events_json":"https://pith.science/api/pith-number/P3P3UC6KZUL6HE5VDIUAPDL75I/events.json","paper":"https://pith.science/paper/P3P3UC6K"},"agent_actions":{"view_html":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I","download_json":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I.json","view_paper":"https://pith.science/paper/P3P3UC6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28027&json=true","fetch_graph":"https://pith.science/api/pith-number/P3P3UC6KZUL6HE5VDIUAPDL75I/graph.json","fetch_events":"https://pith.science/api/pith-number/P3P3UC6KZUL6HE5VDIUAPDL75I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I/action/storage_attestation","attest_author":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I/action/author_attestation","sign_citation":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I/action/citation_signature","submit_replication":"https://pith.science/pith/P3P3UC6KZUL6HE5VDIUAPDL75I/action/replication_record"}},"created_at":"2026-05-28T01:04:56.398872+00:00","updated_at":"2026-05-28T01:04:56.398872+00:00"}