{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CBM7AGNSVAZQODKVEXPJGHTITC","short_pith_number":"pith:CBM7AGNS","schema_version":"1.0","canonical_sha256":"1059f019b2a833070d5525de931e68989078d9cc49b45f2482441618df89c5c9","source":{"kind":"arxiv","id":"2605.20504","version":1},"attestation_state":"computed","paper":{"title":"Box Progressions, Abelian Power-Free Morphisms and A Sieve Technique for the Template Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haydar G\\\"oral, Nihan Tan{\\i}sal{\\i}, Sad{\\i}k Eyido\\u{g}an","submitted_at":"2026-05-19T21:21:46Z","abstract_excerpt":"Given balls and boxes both enumerated by the positive integers, we consider a sequential allocation of the balls into the boxes. We fix $\\ell \\ge 2$. Proceeding in increasing order of box labels, assign to each box the next $r$ smallest balls for some $ 1\\leq r\\leq\\ell$. Given an integer $k\\ge 3$, is there a natural number $N$ such that in any placement of $N$ balls into boxes, there exist $k$ balls whose labels and box labels each form a $k$-term arithmetic progression? We address this question by identifying abelian power-free fixed points of morphisms over a binary alphabet. We present suff"},"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.20504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T21:21:46Z","cross_cats_sorted":[],"title_canon_sha256":"78f8e825094198f9fbe124dfbbd6c0610eb0e308f8cd7f9e2b5c046bf39157d6","abstract_canon_sha256":"ff27733e89a0bcea4909a6d1411005176a5b55e1d86d13bae5cb0590998e936d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:40.049684Z","signature_b64":"FuR72v9LBE1b5MGqD+pw8DzuOvVixKq0DeoWb/dy0HgZmSA1sSAnYH6Aag4GKMjzDUR17mYM7kisj+TnkSKmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1059f019b2a833070d5525de931e68989078d9cc49b45f2482441618df89c5c9","last_reissued_at":"2026-05-21T01:04:40.049190Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:40.049190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Box Progressions, Abelian Power-Free Morphisms and A Sieve Technique for the Template Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haydar G\\\"oral, Nihan Tan{\\i}sal{\\i}, Sad{\\i}k Eyido\\u{g}an","submitted_at":"2026-05-19T21:21:46Z","abstract_excerpt":"Given balls and boxes both enumerated by the positive integers, we consider a sequential allocation of the balls into the boxes. We fix $\\ell \\ge 2$. Proceeding in increasing order of box labels, assign to each box the next $r$ smallest balls for some $ 1\\leq r\\leq\\ell$. Given an integer $k\\ge 3$, is there a natural number $N$ such that in any placement of $N$ balls into boxes, there exist $k$ balls whose labels and box labels each form a $k$-term arithmetic progression? We address this question by identifying abelian power-free fixed points of morphisms over a binary alphabet. We present suff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20504","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.20504/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.20504","created_at":"2026-05-21T01:04:40.049272+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20504v1","created_at":"2026-05-21T01:04:40.049272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20504","created_at":"2026-05-21T01:04:40.049272+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBM7AGNSVAZQ","created_at":"2026-05-21T01:04:40.049272+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBM7AGNSVAZQODKV","created_at":"2026-05-21T01:04:40.049272+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBM7AGNS","created_at":"2026-05-21T01:04:40.049272+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/CBM7AGNSVAZQODKVEXPJGHTITC","json":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC.json","graph_json":"https://pith.science/api/pith-number/CBM7AGNSVAZQODKVEXPJGHTITC/graph.json","events_json":"https://pith.science/api/pith-number/CBM7AGNSVAZQODKVEXPJGHTITC/events.json","paper":"https://pith.science/paper/CBM7AGNS"},"agent_actions":{"view_html":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC","download_json":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC.json","view_paper":"https://pith.science/paper/CBM7AGNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20504&json=true","fetch_graph":"https://pith.science/api/pith-number/CBM7AGNSVAZQODKVEXPJGHTITC/graph.json","fetch_events":"https://pith.science/api/pith-number/CBM7AGNSVAZQODKVEXPJGHTITC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC/action/storage_attestation","attest_author":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC/action/author_attestation","sign_citation":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC/action/citation_signature","submit_replication":"https://pith.science/pith/CBM7AGNSVAZQODKVEXPJGHTITC/action/replication_record"}},"created_at":"2026-05-21T01:04:40.049272+00:00","updated_at":"2026-05-21T01:04:40.049272+00:00"}