{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BKDHDCAE4X5DB2G6DRABWD633G","short_pith_number":"pith:BKDHDCAE","canonical_record":{"source":{"id":"1602.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T22:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"3f3b3d6ae64ede2646e8df018ed7049360e8fd8714a64c5c2faad232d3eef31a","abstract_canon_sha256":"0d726f58bb6e7df043519db83ef722e7e887d98b7510f8f79a388bee9d18f582"},"schema_version":"1.0"},"canonical_sha256":"0a86718804e5fa30e8de1c401b0fdbd9983ccecd60ed0072be6bb895b266a2a7","source":{"kind":"arxiv","id":"1602.07734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07734","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07734v1","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07734","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"BKDHDCAE4X5D","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BKDHDCAE4X5DB2G6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BKDHDCAE","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BKDHDCAE4X5DB2G6DRABWD633G","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T22:25:17Z","cross_cats_sorted":[],"title_canon_sha256":"3f3b3d6ae64ede2646e8df018ed7049360e8fd8714a64c5c2faad232d3eef31a","abstract_canon_sha256":"0d726f58bb6e7df043519db83ef722e7e887d98b7510f8f79a388bee9d18f582"},"schema_version":"1.0"},"canonical_sha256":"0a86718804e5fa30e8de1c401b0fdbd9983ccecd60ed0072be6bb895b266a2a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:00.552086Z","signature_b64":"xTl1N3n1/hA2ksScaGpfhY+gaWDoF5+GCL4zXObEu/iR1YbYJOdK/05Eags3oHt+uOI/YvOpOEKRAKeUcLC9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a86718804e5fa30e8de1c401b0fdbd9983ccecd60ed0072be6bb895b266a2a7","last_reissued_at":"2026-05-18T01:20:00.551344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:00.551344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07734","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-05-18T01:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0+9fvyqcUi5eUE1P10843dCCrufdjjgc4duhcYfA44CycslBQiZ/YP/ZW9bGm3S0rcFGGANDzUg8inMcw2PBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:23:04.984262Z"},"content_sha256":"c9cebffbc3cc3700e6ca254fe8875ad0bc716326ccf85c29274e516fec78296f","schema_version":"1.0","event_id":"sha256:c9cebffbc3cc3700e6ca254fe8875ad0bc716326ccf85c29274e516fec78296f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BKDHDCAE4X5DB2G6DRABWD633G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the distances between Latin squares and the smallest defining set size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicholas Cavenagh, Reshma Ramadurai","submitted_at":"2016-02-24T22:25:17Z","abstract_excerpt":"In this note we show that for each Latin square $L$ of order $n\\geq 2$, there exists a Latin square $L'\\neq L$ of order $n$ such that $L$ and $L'$ differ in at most $8\\sqrt{n}$ cells. Equivalently, each Latin square of order $n$ contains a Latin trade of size at most $8\\sqrt{n}$. We also show that the size of the smallest defining set in a Latin square is $\\Omega(n^{3/2})$. %That is, there are constants $c$ and $n_0$ such that for any $n>n_0$ the size of the smallest defining %set of order $n$ is at least $cn^{3/2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07734","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":""},"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-05-18T01:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SxTcFh/7VtOSeuLs+NogMUu0dVHipUb9W9spi58lrtBUHe5FtzXJi8POuR7nOMJUaGmqQqYU5lHBMvgoD1WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:23:04.984832Z"},"content_sha256":"84480f0e7d393cbbf8a1fb88e60cb5ed3abaf8f9524f1abe745e4e8da2dc3948","schema_version":"1.0","event_id":"sha256:84480f0e7d393cbbf8a1fb88e60cb5ed3abaf8f9524f1abe745e4e8da2dc3948"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKDHDCAE4X5DB2G6DRABWD633G/bundle.json","state_url":"https://pith.science/pith/BKDHDCAE4X5DB2G6DRABWD633G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKDHDCAE4X5DB2G6DRABWD633G/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-05-31T11:23:04Z","links":{"resolver":"https://pith.science/pith/BKDHDCAE4X5DB2G6DRABWD633G","bundle":"https://pith.science/pith/BKDHDCAE4X5DB2G6DRABWD633G/bundle.json","state":"https://pith.science/pith/BKDHDCAE4X5DB2G6DRABWD633G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKDHDCAE4X5DB2G6DRABWD633G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BKDHDCAE4X5DB2G6DRABWD633G","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":"0d726f58bb6e7df043519db83ef722e7e887d98b7510f8f79a388bee9d18f582","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T22:25:17Z","title_canon_sha256":"3f3b3d6ae64ede2646e8df018ed7049360e8fd8714a64c5c2faad232d3eef31a"},"schema_version":"1.0","source":{"id":"1602.07734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07734","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07734v1","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07734","created_at":"2026-05-18T01:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"BKDHDCAE4X5D","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BKDHDCAE4X5DB2G6","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BKDHDCAE","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:84480f0e7d393cbbf8a1fb88e60cb5ed3abaf8f9524f1abe745e4e8da2dc3948","target":"graph","created_at":"2026-05-18T01:20:00Z","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"},"paper":{"abstract_excerpt":"In this note we show that for each Latin square $L$ of order $n\\geq 2$, there exists a Latin square $L'\\neq L$ of order $n$ such that $L$ and $L'$ differ in at most $8\\sqrt{n}$ cells. Equivalently, each Latin square of order $n$ contains a Latin trade of size at most $8\\sqrt{n}$. We also show that the size of the smallest defining set in a Latin square is $\\Omega(n^{3/2})$. %That is, there are constants $c$ and $n_0$ such that for any $n>n_0$ the size of the smallest defining %set of order $n$ is at least $cn^{3/2}$.","authors_text":"Nicholas Cavenagh, Reshma Ramadurai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T22:25:17Z","title":"On the distances between Latin squares and the smallest defining set size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07734","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:c9cebffbc3cc3700e6ca254fe8875ad0bc716326ccf85c29274e516fec78296f","target":"record","created_at":"2026-05-18T01:20:00Z","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":"0d726f58bb6e7df043519db83ef722e7e887d98b7510f8f79a388bee9d18f582","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-24T22:25:17Z","title_canon_sha256":"3f3b3d6ae64ede2646e8df018ed7049360e8fd8714a64c5c2faad232d3eef31a"},"schema_version":"1.0","source":{"id":"1602.07734","kind":"arxiv","version":1}},"canonical_sha256":"0a86718804e5fa30e8de1c401b0fdbd9983ccecd60ed0072be6bb895b266a2a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a86718804e5fa30e8de1c401b0fdbd9983ccecd60ed0072be6bb895b266a2a7","first_computed_at":"2026-05-18T01:20:00.551344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:00.551344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTl1N3n1/hA2ksScaGpfhY+gaWDoF5+GCL4zXObEu/iR1YbYJOdK/05Eags3oHt+uOI/YvOpOEKRAKeUcLC9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:00.552086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9cebffbc3cc3700e6ca254fe8875ad0bc716326ccf85c29274e516fec78296f","sha256:84480f0e7d393cbbf8a1fb88e60cb5ed3abaf8f9524f1abe745e4e8da2dc3948"],"state_sha256":"3337b5035f7cb6e4eeb323366dd111da05f608d487e4d417b6c9d4228a90905f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLnzYNLfipjEehSL+toWv6cayoyPOC3IRIblileHRFxNz2qSXtVLTK96Ci1Uh1dj1HtV65aw1ykqLJuxFyVhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:23:04.987108Z","bundle_sha256":"74af6fe1d2bba63e31e0aa5c818b9d7b54dcabda1077920a24b7d54a1a7207ca"}}