{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CIATMAKBS5UJSMYMFSENGME3GM","short_pith_number":"pith:CIATMAKB","canonical_record":{"source":{"id":"1603.07720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-24T19:49:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0c842b5bb45fdc68d30c6182b12717d749dd053f084e19ff7c780b91408ca2fa","abstract_canon_sha256":"a883b673bb1920b19956d1e446ca61300fc616131b02f5914397ae84b8cfe720"},"schema_version":"1.0"},"canonical_sha256":"1201360141976899330c2c88d3309b3327bb911b30991d14c9f10e46fc6b25b0","source":{"kind":"arxiv","id":"1603.07720","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07720","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07720v3","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07720","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"CIATMAKBS5UJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIATMAKBS5UJSMYM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIATMAKB","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CIATMAKBS5UJSMYMFSENGME3GM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.07720","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-24T19:49:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0c842b5bb45fdc68d30c6182b12717d749dd053f084e19ff7c780b91408ca2fa","abstract_canon_sha256":"a883b673bb1920b19956d1e446ca61300fc616131b02f5914397ae84b8cfe720"},"schema_version":"1.0"},"canonical_sha256":"1201360141976899330c2c88d3309b3327bb911b30991d14c9f10e46fc6b25b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:39.291241Z","signature_b64":"Z6t2n1Zk3NBmfy8TEby2rORy23TTq5xbduXuPpwpPl74KnWLq2CZ/inwV6zSaHTv49LLp6W6a3cgBpJontUICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1201360141976899330c2c88d3309b3327bb911b30991d14c9f10e46fc6b25b0","last_reissued_at":"2026-05-18T00:55:39.290641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:39.290641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.07720","source_version":3,"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-18T00:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34X7FyKj7G7IuKT+UCOiBtxltl9zTKMzCUZITPdJb702v8ijoKO4ryHtBaZG3jwZx8VPBHhWrl3vtRWXZIaxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:34:01.924033Z"},"content_sha256":"a3f28d8232bd5a2f04e7b8eb7510033181f96cb1334528aad81e37db9f8f8397","schema_version":"1.0","event_id":"sha256:a3f28d8232bd5a2f04e7b8eb7510033181f96cb1334528aad81e37db9f8f8397"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CIATMAKBS5UJSMYMFSENGME3GM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Under recurrence in the Khintchine recurrence theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"M\\'at\\'e Wierdl, Michael Boshernitzan, Nikos Frantzikinakis","submitted_at":"2016-03-24T19:49:17Z","abstract_excerpt":"The Khintchine recurrence theorem asserts that on a measure preserving system, for every set $A$ and $\\varepsilon>0$, we have $\\mu(A\\cap T^{-n}A)\\geq \\mu(A)^2-\\varepsilon$ for infinitely many $n\\in \\mathbb{N}$. We show that there are systems having under-recurrent sets $A$, in the sense that the inequality $\\mu(A\\cap T^{-n}A)< \\mu(A)^2$ holds for every $n\\in \\mathbb{N}$. In particular, all ergodic systems of positive entropy have under-recurrent sets. On the other hand, answering a question of V.~Bergelson, we show that not all mixing systems have under-recurrent sets. We also study variants o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07720","kind":"arxiv","version":3},"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-18T00:55:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWOO20XRHGMCvIendtEVs0h96PyTVpU1bXmEzy9jij9hEUPzZYvckV1bEYJ5G1WjRpYy17Wwjf37TIs4p0FiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:34:01.924760Z"},"content_sha256":"062995cb4862af0d3e910a0f0ea891014fb4db206c3fb41c1d8c6662195b9c3f","schema_version":"1.0","event_id":"sha256:062995cb4862af0d3e910a0f0ea891014fb4db206c3fb41c1d8c6662195b9c3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CIATMAKBS5UJSMYMFSENGME3GM/bundle.json","state_url":"https://pith.science/pith/CIATMAKBS5UJSMYMFSENGME3GM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CIATMAKBS5UJSMYMFSENGME3GM/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-01T02:34:01Z","links":{"resolver":"https://pith.science/pith/CIATMAKBS5UJSMYMFSENGME3GM","bundle":"https://pith.science/pith/CIATMAKBS5UJSMYMFSENGME3GM/bundle.json","state":"https://pith.science/pith/CIATMAKBS5UJSMYMFSENGME3GM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CIATMAKBS5UJSMYMFSENGME3GM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CIATMAKBS5UJSMYMFSENGME3GM","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":"a883b673bb1920b19956d1e446ca61300fc616131b02f5914397ae84b8cfe720","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-24T19:49:17Z","title_canon_sha256":"0c842b5bb45fdc68d30c6182b12717d749dd053f084e19ff7c780b91408ca2fa"},"schema_version":"1.0","source":{"id":"1603.07720","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.07720","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"arxiv_version","alias_value":"1603.07720v3","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.07720","created_at":"2026-05-18T00:55:39Z"},{"alias_kind":"pith_short_12","alias_value":"CIATMAKBS5UJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CIATMAKBS5UJSMYM","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CIATMAKB","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:062995cb4862af0d3e910a0f0ea891014fb4db206c3fb41c1d8c6662195b9c3f","target":"graph","created_at":"2026-05-18T00:55:39Z","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":"The Khintchine recurrence theorem asserts that on a measure preserving system, for every set $A$ and $\\varepsilon>0$, we have $\\mu(A\\cap T^{-n}A)\\geq \\mu(A)^2-\\varepsilon$ for infinitely many $n\\in \\mathbb{N}$. We show that there are systems having under-recurrent sets $A$, in the sense that the inequality $\\mu(A\\cap T^{-n}A)< \\mu(A)^2$ holds for every $n\\in \\mathbb{N}$. In particular, all ergodic systems of positive entropy have under-recurrent sets. On the other hand, answering a question of V.~Bergelson, we show that not all mixing systems have under-recurrent sets. We also study variants o","authors_text":"M\\'at\\'e Wierdl, Michael Boshernitzan, Nikos Frantzikinakis","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-24T19:49:17Z","title":"Under recurrence in the Khintchine recurrence theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.07720","kind":"arxiv","version":3},"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:a3f28d8232bd5a2f04e7b8eb7510033181f96cb1334528aad81e37db9f8f8397","target":"record","created_at":"2026-05-18T00:55:39Z","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":"a883b673bb1920b19956d1e446ca61300fc616131b02f5914397ae84b8cfe720","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-24T19:49:17Z","title_canon_sha256":"0c842b5bb45fdc68d30c6182b12717d749dd053f084e19ff7c780b91408ca2fa"},"schema_version":"1.0","source":{"id":"1603.07720","kind":"arxiv","version":3}},"canonical_sha256":"1201360141976899330c2c88d3309b3327bb911b30991d14c9f10e46fc6b25b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1201360141976899330c2c88d3309b3327bb911b30991d14c9f10e46fc6b25b0","first_computed_at":"2026-05-18T00:55:39.290641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:39.290641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z6t2n1Zk3NBmfy8TEby2rORy23TTq5xbduXuPpwpPl74KnWLq2CZ/inwV6zSaHTv49LLp6W6a3cgBpJontUICg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:39.291241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.07720","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3f28d8232bd5a2f04e7b8eb7510033181f96cb1334528aad81e37db9f8f8397","sha256:062995cb4862af0d3e910a0f0ea891014fb4db206c3fb41c1d8c6662195b9c3f"],"state_sha256":"a28a86250ab54f873c0a5a7cac1ea6e1ccb79f1d2f08f6d5fa4b85943bda08a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpQcvTGzJLgny/F7GlKm1/Ywxx0lphkX1n9gvo0z+u3iATgOAIzvOW/e9nHdxUJE8l4x4r1rakTpmy6puFnYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:34:01.929544Z","bundle_sha256":"ba73581e1867805356711ea8dbf6b6da556b65131906cda2567a7d2a5150f77d"}}