{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NKHWEUWBMLOEU4GAU3F3T74JGC","short_pith_number":"pith:NKHWEUWB","schema_version":"1.0","canonical_sha256":"6a8f6252c162dc4a70c0a6cbb9ff8930b3a1c91a1757e7c43a5af1a72fde9c6e","source":{"kind":"arxiv","id":"2606.12880","version":1},"attestation_state":"computed","paper":{"title":"Monochromatic $k$ in a row","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kuo-Han Ku","submitted_at":"2026-06-11T04:11:49Z","abstract_excerpt":"We study a variant of the $k$-in-a-row game in which players alternatively claim positions until a $k$-in-a-row is created among all claimed positions. This leads to the constraint near $k$-in-a-row avoiding on configurations and the associated problem of determining their extremal densities of such configurations.\n  We investigate this problem on two types of boards: the grid $\\mathbb{Z}^2$ and hypercubes $[k]^d$. For the grid $\\mathbb{Z}^2$, we establish nearly tight bounds on the maximum density $D(k,\\mathbb{Z}^2)$, showing that $D(k,\\mathbb{Z}^2)=1-\\frac{2}{k}$ whenever $3\\nmid k$, and det"},"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":"2606.12880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-11T04:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"e15a0773b29095f34e47ee9ce63e1e384be9f30bb7e91efb17495cba4689e0c2","abstract_canon_sha256":"359d99a8fee91c49ba3c14ccb8b5dc0ab6c82c7a5ae6afed600ebe7f04fe4689"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:56.411936Z","signature_b64":"HrezF41r311+z7ND9zG+FiQ9sMSpe1XyA0Slo/2aCQpmiYVZ7uZfkY18ewlI7Ne1JbLEvUiA/EritkxNsjg7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a8f6252c162dc4a70c0a6cbb9ff8930b3a1c91a1757e7c43a5af1a72fde9c6e","last_reissued_at":"2026-06-12T01:08:56.411174Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:56.411174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monochromatic $k$ in a row","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kuo-Han Ku","submitted_at":"2026-06-11T04:11:49Z","abstract_excerpt":"We study a variant of the $k$-in-a-row game in which players alternatively claim positions until a $k$-in-a-row is created among all claimed positions. This leads to the constraint near $k$-in-a-row avoiding on configurations and the associated problem of determining their extremal densities of such configurations.\n  We investigate this problem on two types of boards: the grid $\\mathbb{Z}^2$ and hypercubes $[k]^d$. For the grid $\\mathbb{Z}^2$, we establish nearly tight bounds on the maximum density $D(k,\\mathbb{Z}^2)$, showing that $D(k,\\mathbb{Z}^2)=1-\\frac{2}{k}$ whenever $3\\nmid k$, and det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12880","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/2606.12880/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":"2606.12880","created_at":"2026-06-12T01:08:56.411299+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12880v1","created_at":"2026-06-12T01:08:56.411299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12880","created_at":"2026-06-12T01:08:56.411299+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKHWEUWBMLOE","created_at":"2026-06-12T01:08:56.411299+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKHWEUWBMLOEU4GA","created_at":"2026-06-12T01:08:56.411299+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKHWEUWB","created_at":"2026-06-12T01:08:56.411299+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/NKHWEUWBMLOEU4GAU3F3T74JGC","json":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC.json","graph_json":"https://pith.science/api/pith-number/NKHWEUWBMLOEU4GAU3F3T74JGC/graph.json","events_json":"https://pith.science/api/pith-number/NKHWEUWBMLOEU4GAU3F3T74JGC/events.json","paper":"https://pith.science/paper/NKHWEUWB"},"agent_actions":{"view_html":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC","download_json":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC.json","view_paper":"https://pith.science/paper/NKHWEUWB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12880&json=true","fetch_graph":"https://pith.science/api/pith-number/NKHWEUWBMLOEU4GAU3F3T74JGC/graph.json","fetch_events":"https://pith.science/api/pith-number/NKHWEUWBMLOEU4GAU3F3T74JGC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC/action/storage_attestation","attest_author":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC/action/author_attestation","sign_citation":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC/action/citation_signature","submit_replication":"https://pith.science/pith/NKHWEUWBMLOEU4GAU3F3T74JGC/action/replication_record"}},"created_at":"2026-06-12T01:08:56.411299+00:00","updated_at":"2026-06-12T01:08:56.411299+00:00"}