{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UNGIBCDOCOR622OGR7WERZ7ZL2","short_pith_number":"pith:UNGIBCDO","schema_version":"1.0","canonical_sha256":"a34c80886e13a3ed69c68fec48e7f95e82c6ce210ee73db27b22f2acebe98bee","source":{"kind":"arxiv","id":"2205.01456","version":2},"attestation_state":"computed","paper":{"title":"Schur properties of randomly perturbed sets","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Charlotte Knierim, Patrick Morris, Shagnik Das","submitted_at":"2022-05-03T12:34:58Z","abstract_excerpt":"A set $A$ of integers is said to be \\emph{Schur} if any two-colouring of $A$ results in monochromatic $x,y$ and $z$ with $x+y=z$. We study the following problem: how many random integers from $[n]$ need to be added to some $A\\subseteq [n]$ to ensure with high probability that the resulting set is Schur? Hu showed in 1980 that when $|A|> \\lceil 4n/5 \\rceil$, no random integers are needed, as $A$ is already guaranteed to be Schur. Recently, Aigner-Horev and Person showed that for any dense set of integers $A\\subseteq [n]$, adding $\\omega(n^{1/3})$ random integers suffices, noting that this is op"},"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":"2205.01456","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-05-03T12:34:58Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"ee1c71b323fe34267013a23099ab587754e5ffa51c0eba7b84a41f2af3f4ccae","abstract_canon_sha256":"125f31925738cd291cbea498c318107f73b658a2d626a13616c9a2fdeeb31e1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.187123Z","signature_b64":"lDZRlF2Y9VFDn/VDydMWEgWfS7BJm9wOTE4EnAnTiEBWR1eOhwzH8xgW8yW6xKofjqKeL4x3HAqP31y0JJ9PAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34c80886e13a3ed69c68fec48e7f95e82c6ce210ee73db27b22f2acebe98bee","last_reissued_at":"2026-06-23T03:13:42.186665Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.186665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Schur properties of randomly perturbed sets","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Charlotte Knierim, Patrick Morris, Shagnik Das","submitted_at":"2022-05-03T12:34:58Z","abstract_excerpt":"A set $A$ of integers is said to be \\emph{Schur} if any two-colouring of $A$ results in monochromatic $x,y$ and $z$ with $x+y=z$. We study the following problem: how many random integers from $[n]$ need to be added to some $A\\subseteq [n]$ to ensure with high probability that the resulting set is Schur? Hu showed in 1980 that when $|A|> \\lceil 4n/5 \\rceil$, no random integers are needed, as $A$ is already guaranteed to be Schur. Recently, Aigner-Horev and Person showed that for any dense set of integers $A\\subseteq [n]$, adding $\\omega(n^{1/3})$ random integers suffices, noting that this is op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.01456","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/2205.01456/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":"2205.01456","created_at":"2026-06-23T03:13:42.186723+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.01456v2","created_at":"2026-06-23T03:13:42.186723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.01456","created_at":"2026-06-23T03:13:42.186723+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNGIBCDOCOR6","created_at":"2026-06-23T03:13:42.186723+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNGIBCDOCOR622OG","created_at":"2026-06-23T03:13:42.186723+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNGIBCDO","created_at":"2026-06-23T03:13:42.186723+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/UNGIBCDOCOR622OGR7WERZ7ZL2","json":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2.json","graph_json":"https://pith.science/api/pith-number/UNGIBCDOCOR622OGR7WERZ7ZL2/graph.json","events_json":"https://pith.science/api/pith-number/UNGIBCDOCOR622OGR7WERZ7ZL2/events.json","paper":"https://pith.science/paper/UNGIBCDO"},"agent_actions":{"view_html":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2","download_json":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2.json","view_paper":"https://pith.science/paper/UNGIBCDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.01456&json=true","fetch_graph":"https://pith.science/api/pith-number/UNGIBCDOCOR622OGR7WERZ7ZL2/graph.json","fetch_events":"https://pith.science/api/pith-number/UNGIBCDOCOR622OGR7WERZ7ZL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2/action/storage_attestation","attest_author":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2/action/author_attestation","sign_citation":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2/action/citation_signature","submit_replication":"https://pith.science/pith/UNGIBCDOCOR622OGR7WERZ7ZL2/action/replication_record"}},"created_at":"2026-06-23T03:13:42.186723+00:00","updated_at":"2026-06-23T03:13:42.186723+00:00"}