{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DTI3735C6WTMKIVXJXVTWWV2HW","short_pith_number":"pith:DTI3735C","canonical_record":{"source":{"id":"1509.05665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T15:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"13013024086b71e37e3eca1187bdb324ef25e2a486017b5a27d5a7570cba6fbd","abstract_canon_sha256":"677ab4ca55f26a79fb7fa50e1ac020a59a3242b10fce30ae01635650a64c9d73"},"schema_version":"1.0"},"canonical_sha256":"1cd1bfefa2f5a6c522b74deb3b5aba3db276e54b170b061a516d8f69eae02305","source":{"kind":"arxiv","id":"1509.05665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05665","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05665v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05665","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"DTI3735C6WTM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DTI3735C6WTMKIVX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DTI3735C","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DTI3735C6WTMKIVXJXVTWWV2HW","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T15:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"13013024086b71e37e3eca1187bdb324ef25e2a486017b5a27d5a7570cba6fbd","abstract_canon_sha256":"677ab4ca55f26a79fb7fa50e1ac020a59a3242b10fce30ae01635650a64c9d73"},"schema_version":"1.0"},"canonical_sha256":"1cd1bfefa2f5a6c522b74deb3b5aba3db276e54b170b061a516d8f69eae02305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.654211Z","signature_b64":"w97GgdXAVVk4Vu0dT3L3eQuBchbKYEA+77TwDFdXvgIDio49iPAoofMJ4RPLSehxiGKs5v8SBZyP6ZN1OJIDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd1bfefa2f5a6c522b74deb3b5aba3db276e54b170b061a516d8f69eae02305","last_reissued_at":"2026-05-18T01:32:42.653844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.653844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05665","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:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zQgmkcQ5W1LGpUrY0xCtDX99KbBWGHPoRgaNvo9lrGN8pv6j7ay12oxVncoO+3gRThy68nEPjGRGOVpD0RJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:47:49.746854Z"},"content_sha256":"e16a03b0d6d4c28f3f84d3e51cbf0e69d5c680712447e157894ecec8d2db7ced","schema_version":"1.0","event_id":"sha256:e16a03b0d6d4c28f3f84d3e51cbf0e69d5c680712447e157894ecec8d2db7ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DTI3735C6WTMKIVXJXVTWWV2HW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overlapping latin subsquares and full products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian M. Wanless, Joshua M. Browning, Petr Vojt\\v{e}chovsk\\'y","submitted_at":"2015-09-18T15:30:01Z","abstract_excerpt":"We derive necessary and sufficient conditions for there to exist a latin square of order $n$ containing two subsquares of order $a$ and $b$ that intersect in a subsquare of order $c$. We also solve the case of two disjoint subsquares. We use these results to show that: (a) A latin square of order $n$ cannot have more than $\\frac nm{n \\choose h}/{m\\choose h}$ subsquares of order $m$, where $h=\\lceil(m+1)/2\\rceil$. Indeed, the number of subsquares of order $m$ is bounded by a polynomial of degree at most $\\sqrt{2m}+2$ in $n$. (b) For all $n\\ge5$ there exists a loop of order $n$ in which every el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05665","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:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rJlRKe2KumU9L4XSGmaxwjlrXZhZHW4N1HGKsVjWzlqvE5ApltTBfoD6Z9SN05P1GznB4vg0O2REhicwTVqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:47:49.747196Z"},"content_sha256":"2ea5d9e3bf7b1690c5659c1329684eec70403b37dc5870290f6f6e86682e1a29","schema_version":"1.0","event_id":"sha256:2ea5d9e3bf7b1690c5659c1329684eec70403b37dc5870290f6f6e86682e1a29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTI3735C6WTMKIVXJXVTWWV2HW/bundle.json","state_url":"https://pith.science/pith/DTI3735C6WTMKIVXJXVTWWV2HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTI3735C6WTMKIVXJXVTWWV2HW/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-06-01T06:47:49Z","links":{"resolver":"https://pith.science/pith/DTI3735C6WTMKIVXJXVTWWV2HW","bundle":"https://pith.science/pith/DTI3735C6WTMKIVXJXVTWWV2HW/bundle.json","state":"https://pith.science/pith/DTI3735C6WTMKIVXJXVTWWV2HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTI3735C6WTMKIVXJXVTWWV2HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DTI3735C6WTMKIVXJXVTWWV2HW","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":"677ab4ca55f26a79fb7fa50e1ac020a59a3242b10fce30ae01635650a64c9d73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T15:30:01Z","title_canon_sha256":"13013024086b71e37e3eca1187bdb324ef25e2a486017b5a27d5a7570cba6fbd"},"schema_version":"1.0","source":{"id":"1509.05665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05665","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05665v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05665","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"DTI3735C6WTM","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DTI3735C6WTMKIVX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DTI3735C","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:2ea5d9e3bf7b1690c5659c1329684eec70403b37dc5870290f6f6e86682e1a29","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"We derive necessary and sufficient conditions for there to exist a latin square of order $n$ containing two subsquares of order $a$ and $b$ that intersect in a subsquare of order $c$. We also solve the case of two disjoint subsquares. We use these results to show that: (a) A latin square of order $n$ cannot have more than $\\frac nm{n \\choose h}/{m\\choose h}$ subsquares of order $m$, where $h=\\lceil(m+1)/2\\rceil$. Indeed, the number of subsquares of order $m$ is bounded by a polynomial of degree at most $\\sqrt{2m}+2$ in $n$. (b) For all $n\\ge5$ there exists a loop of order $n$ in which every el","authors_text":"Ian M. Wanless, Joshua M. Browning, Petr Vojt\\v{e}chovsk\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T15:30:01Z","title":"Overlapping latin subsquares and full products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05665","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:e16a03b0d6d4c28f3f84d3e51cbf0e69d5c680712447e157894ecec8d2db7ced","target":"record","created_at":"2026-05-18T01:32:42Z","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":"677ab4ca55f26a79fb7fa50e1ac020a59a3242b10fce30ae01635650a64c9d73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-18T15:30:01Z","title_canon_sha256":"13013024086b71e37e3eca1187bdb324ef25e2a486017b5a27d5a7570cba6fbd"},"schema_version":"1.0","source":{"id":"1509.05665","kind":"arxiv","version":1}},"canonical_sha256":"1cd1bfefa2f5a6c522b74deb3b5aba3db276e54b170b061a516d8f69eae02305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cd1bfefa2f5a6c522b74deb3b5aba3db276e54b170b061a516d8f69eae02305","first_computed_at":"2026-05-18T01:32:42.653844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.653844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w97GgdXAVVk4Vu0dT3L3eQuBchbKYEA+77TwDFdXvgIDio49iPAoofMJ4RPLSehxiGKs5v8SBZyP6ZN1OJIDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.654211Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e16a03b0d6d4c28f3f84d3e51cbf0e69d5c680712447e157894ecec8d2db7ced","sha256:2ea5d9e3bf7b1690c5659c1329684eec70403b37dc5870290f6f6e86682e1a29"],"state_sha256":"725e34ab3914fad101480ed49522a6ac517572d35902ebd6a2df0a3ada700071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCrLUpcw+DhT2XTr1aQ4UZARTmrL61WV4MK+RCZSJ32mM778z++c/lr6C6YYAaxRbz9oovAcY3wfV2SAUzguBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:47:49.749226Z","bundle_sha256":"a5d27f856476d381eb80f27a67b6e8b2500b14b07b19e91fe632526391e56d7f"}}