{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EMOCETRAQASX6O7U2YEBZWB6EX","short_pith_number":"pith:EMOCETRA","schema_version":"1.0","canonical_sha256":"231c224e2080257f3bf4d6081cd83e25f2dbf734424c9d6206a85b538294ead8","source":{"kind":"arxiv","id":"1910.12835","version":2},"attestation_state":"computed","paper":{"title":"Deviation probabilities for arithmetic progressions and other regular discrete structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT","math.PR"],"primary_cat":"math.CO","authors_text":"Gonzalo Fiz Pontiveros, Matheus Secco, Oriol Serra, Simon Griffiths","submitted_at":"2019-10-28T17:46:20Z","abstract_excerpt":"Let the random variable $X\\, :=\\, e(\\mathcal{H}[B])$ count the number of edges of a hypergraph $\\mathcal{H}$ induced by a random $m$ element subset $B$ of its vertex set. Focussing on the case that $\\mathcal{H}$ satisfies some regularity condition we prove bounds on the probability that $X$ is far from its mean. It is possible to apply these results to discrete structures such as the set of $k$-term arithmetic progressions in the cyclic group $\\mathbb{Z}_N$. Furthermore, we show that our main theorem is essentially best possible and we deduce results for the case $B\\sim B_p$ is generated by in"},"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":"1910.12835","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-10-28T17:46:20Z","cross_cats_sorted":["math.NT","math.PR"],"title_canon_sha256":"66b0438477c01a46e4b1501ab4569bddefb7bcd29e3707f4c85c3fb9a91ca25f","abstract_canon_sha256":"8fccc47e4fbe98e79563ae853fbf373bd7230558ebffc05d3769d0b060f3a27a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:53.981368Z","signature_b64":"hwVgJNfKAOAeVK0Ci6aVnMaCiZ53c93MVa+R2B00pSaKNMH9P3hDDVCfCChc/udEb5XjZeznH0L2OEyyIwNFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"231c224e2080257f3bf4d6081cd83e25f2dbf734424c9d6206a85b538294ead8","last_reissued_at":"2026-07-05T02:27:53.980926Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:53.980926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deviation probabilities for arithmetic progressions and other regular discrete structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT","math.PR"],"primary_cat":"math.CO","authors_text":"Gonzalo Fiz Pontiveros, Matheus Secco, Oriol Serra, Simon Griffiths","submitted_at":"2019-10-28T17:46:20Z","abstract_excerpt":"Let the random variable $X\\, :=\\, e(\\mathcal{H}[B])$ count the number of edges of a hypergraph $\\mathcal{H}$ induced by a random $m$ element subset $B$ of its vertex set. Focussing on the case that $\\mathcal{H}$ satisfies some regularity condition we prove bounds on the probability that $X$ is far from its mean. It is possible to apply these results to discrete structures such as the set of $k$-term arithmetic progressions in the cyclic group $\\mathbb{Z}_N$. Furthermore, we show that our main theorem is essentially best possible and we deduce results for the case $B\\sim B_p$ is generated by in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12835","kind":"arxiv","version":2},"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/1910.12835/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":"1910.12835","created_at":"2026-07-05T02:27:53.980989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12835v2","created_at":"2026-07-05T02:27:53.980989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12835","created_at":"2026-07-05T02:27:53.980989+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMOCETRAQASX","created_at":"2026-07-05T02:27:53.980989+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMOCETRAQASX6O7U","created_at":"2026-07-05T02:27:53.980989+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMOCETRA","created_at":"2026-07-05T02:27:53.980989+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/EMOCETRAQASX6O7U2YEBZWB6EX","json":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX.json","graph_json":"https://pith.science/api/pith-number/EMOCETRAQASX6O7U2YEBZWB6EX/graph.json","events_json":"https://pith.science/api/pith-number/EMOCETRAQASX6O7U2YEBZWB6EX/events.json","paper":"https://pith.science/paper/EMOCETRA"},"agent_actions":{"view_html":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX","download_json":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX.json","view_paper":"https://pith.science/paper/EMOCETRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12835&json=true","fetch_graph":"https://pith.science/api/pith-number/EMOCETRAQASX6O7U2YEBZWB6EX/graph.json","fetch_events":"https://pith.science/api/pith-number/EMOCETRAQASX6O7U2YEBZWB6EX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX/action/storage_attestation","attest_author":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX/action/author_attestation","sign_citation":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX/action/citation_signature","submit_replication":"https://pith.science/pith/EMOCETRAQASX6O7U2YEBZWB6EX/action/replication_record"}},"created_at":"2026-07-05T02:27:53.980989+00:00","updated_at":"2026-07-05T02:27:53.980989+00:00"}