{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZMFTFVEVNQLPIRXUBVEMBJB43J","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":"d0cac82708ee385cd2e624d401612bed7c16c93eb32734fbff4a8366328a09c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2025-11-03T21:40:30Z","title_canon_sha256":"f803ddb8cb6363a0c4c5e6bc9620caa6339de156861785fc643a432626d285b6"},"schema_version":"1.0","source":{"id":"2511.02080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.02080","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"2511.02080v2","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02080","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZMFTFVEVNQLP","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZMFTFVEVNQLPIRXU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZMFTFVEV","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:107601e2e5d2216854ef0bb0650df9b21a865fe150ca1e3c1e8107d582705117","target":"graph","created_at":"2026-05-18T03:10:11Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove a structure theorem showing that, in a minimal system, return-time sets coincide -- up to a non-piecewise syndetic set -- with those in its maximal infinite-step pronilfactor."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The argument depends on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye to reduce the system to its pronilfactor."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In minimal systems, polynomial return-time sets coincide up to non-piecewise syndetic sets with those in the maximal infinite-step pronilfactor, yielding new multiple recurrence theorems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In minimal systems, polynomial return-time sets coincide with those in the maximal infinite-step pronilfactor up to non-piecewise syndetic sets."}],"snapshot_sha256":"08c322690d485472c998a0d64575c5e546bc45d07294303b4485e4e26f6772d2"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f16b68528335316e91b321610f3f73e7f1b4886eca9301c40c99a3de1d77c640"},"paper":{"abstract_excerpt":"We investigate the structure of return-time sets determined by orbits along polynomial tuples in minimal topological dynamical systems. Building on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye, we prove a structure theorem showing that, in a minimal system, return-time sets coincide -- up to a non-piecewise syndetic set -- with those in its maximal infinite-step pronilfactor. As applications, we establish three new multiple recurrence theorems concerning linear recurrence along dynamically defined syndetic sets and polynomial recurrence along arithmetic p","authors_text":"Andreas Koutsogiannis, Anh N. Le, Daniel Glasscock, Donald Robertson, Florian K. Richter, Joel Moreira","cross_cats":[],"headline":"In minimal systems, polynomial return-time sets coincide with those in the maximal infinite-step pronilfactor up to non-piecewise syndetic sets.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2025-11-03T21:40:30Z","title":"A structure theorem for polynomial return-time sets in minimal systems"},"references":{"count":32,"internal_anchors":0,"resolved_work":32,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"J. Auslander. Minimal flows and their extensions , volume 153 of North-Holland Mathematics Studies. North-Holland Publishing Co., Amsterdam, 1988. Notas de Matem´ atica [Mathematical Notes], 122. 9, 1","work_id":"134b21d5-9f4e-4649-a983-e4017ce33172","year":1988},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"K. Berg. Quasi-disjointness in ergodic theory. Trans. Amer. Math. Soc., 162:71–87, 1971. 15","work_id":"78caf364-a33e-45ca-9e80-406617b4b197","year":1971},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"V. Bergelson, B. Host, and B. Kra. Multiple recurrence and nilsequences. Invent. Math. , 160(2):261–303, 2005. With an appendix by Imre Ruzsa. 29","work_id":"6dfb0817-f8cf-4719-b830-ed466b3c9901","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"V. Bergelson, A. Leibman, and E. Lesigne. Intersective polynomials and the polynomial Szemer´ edi theorem. Adv. Math., 219(1):369–388, 2008. 23","work_id":"e2b642b0-d1fe-4233-9418-f1b2bc198e2a","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"V. Bergelson and R. McCutcheon. An ergodic IP polynomial Szemer´ edi theorem. Mem. Amer. Math. Soc., 146(695):viii+106, 2000. 3, 4, 13","work_id":"173f7f55-125c-45e4-8b50-9f9615b6b832","year":2000}],"snapshot_sha256":"eea5f58e35b07a7fb0432bfe600a043e772cd66f1918e0488bef2124619b5da6"},"source":{"id":"2511.02080","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-18T00:45:18.660303Z","id":"49d33c35-0493-44cb-8d63-414e2e9df989","model_set":{"reader":"grok-4.3"},"one_line_summary":"In minimal systems, polynomial return-time sets coincide up to non-piecewise syndetic sets with those in the maximal infinite-step pronilfactor, yielding new multiple recurrence theorems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In minimal systems, polynomial return-time sets coincide with those in the maximal infinite-step pronilfactor up to non-piecewise syndetic sets.","strongest_claim":"We prove a structure theorem showing that, in a minimal system, return-time sets coincide -- up to a non-piecewise syndetic set -- with those in its maximal infinite-step pronilfactor.","weakest_assumption":"The argument depends on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye to reduce the system to its pronilfactor."}},"verdict_id":"49d33c35-0493-44cb-8d63-414e2e9df989"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:63a6f571b84a49d2f6aadfdca52bcf18b0f34c8505e3fd7a6f891139f4f418f3","target":"record","created_at":"2026-05-18T03:10:11Z","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":"d0cac82708ee385cd2e624d401612bed7c16c93eb32734fbff4a8366328a09c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2025-11-03T21:40:30Z","title_canon_sha256":"f803ddb8cb6363a0c4c5e6bc9620caa6339de156861785fc643a432626d285b6"},"schema_version":"1.0","source":{"id":"2511.02080","kind":"arxiv","version":2}},"canonical_sha256":"cb0b32d4956c16f446f40d48c0a43cda5b421c4a5e10cd32378db583a823eb3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb0b32d4956c16f446f40d48c0a43cda5b421c4a5e10cd32378db583a823eb3e","first_computed_at":"2026-05-18T03:10:11.897841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:11.897841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fLn0m8ctgZkyZfBD5JQxTKVamM5ZGgscfSctXiYSYRftb5aa9RkNO3AFok99lqKmepzPIlH/TKX0jD5PGD/ADA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:11.898711Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.02080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63a6f571b84a49d2f6aadfdca52bcf18b0f34c8505e3fd7a6f891139f4f418f3","sha256:107601e2e5d2216854ef0bb0650df9b21a865fe150ca1e3c1e8107d582705117"],"state_sha256":"89e939e31843f482da48e956ae1bca9a250c847b7a1da23a4c5beb369d98ee3f"}