{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Z3FRS6G2GFE77K3X2XSSIPI3QI","short_pith_number":"pith:Z3FRS6G2","schema_version":"1.0","canonical_sha256":"cecb1978da3149ffab77d5e5243d1b82194d97708d5bfd52840712e1509843a0","source":{"kind":"arxiv","id":"2605.28570","version":1},"attestation_state":"computed","paper":{"title":"Ten Squares Force an Overlap","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"math.CO","authors_text":"Jeffrey Shallit","submitted_at":"2026-05-27T14:56:13Z","abstract_excerpt":"We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of squares."},"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.28570","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-27T14:56:13Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"7455c0f271bc0e7243ac2eac4f5da747d45da05ac038b6f698d4ffe82c002762","abstract_canon_sha256":"e628bd04b50ad52cf500f3560f643ebeb9cce7b3d9d565121f639f6619c081d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:56.655237Z","signature_b64":"IZDruqd+7ThbizZAqtAGWnLf8Y+9npsCcy6FT6mweNqNoTdyO68/Jb2fEShGOFUJhM9DDj/BHWMVca3BcXw6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cecb1978da3149ffab77d5e5243d1b82194d97708d5bfd52840712e1509843a0","last_reissued_at":"2026-05-28T02:04:56.654825Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:56.654825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ten Squares Force an Overlap","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"math.CO","authors_text":"Jeffrey Shallit","submitted_at":"2026-05-27T14:56:13Z","abstract_excerpt":"We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of squares."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28570","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.28570/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.28570","created_at":"2026-05-28T02:04:56.654887+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.28570v1","created_at":"2026-05-28T02:04:56.654887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28570","created_at":"2026-05-28T02:04:56.654887+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3FRS6G2GFE7","created_at":"2026-05-28T02:04:56.654887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3FRS6G2GFE77K3X","created_at":"2026-05-28T02:04:56.654887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3FRS6G2","created_at":"2026-05-28T02:04:56.654887+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/Z3FRS6G2GFE77K3X2XSSIPI3QI","json":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI.json","graph_json":"https://pith.science/api/pith-number/Z3FRS6G2GFE77K3X2XSSIPI3QI/graph.json","events_json":"https://pith.science/api/pith-number/Z3FRS6G2GFE77K3X2XSSIPI3QI/events.json","paper":"https://pith.science/paper/Z3FRS6G2"},"agent_actions":{"view_html":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI","download_json":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI.json","view_paper":"https://pith.science/paper/Z3FRS6G2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.28570&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3FRS6G2GFE77K3X2XSSIPI3QI/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3FRS6G2GFE77K3X2XSSIPI3QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI/action/storage_attestation","attest_author":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI/action/author_attestation","sign_citation":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI/action/citation_signature","submit_replication":"https://pith.science/pith/Z3FRS6G2GFE77K3X2XSSIPI3QI/action/replication_record"}},"created_at":"2026-05-28T02:04:56.654887+00:00","updated_at":"2026-05-28T02:04:56.654887+00:00"}