{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YE2UP3ASIUNQ5SKMTEP24XIJ76","short_pith_number":"pith:YE2UP3AS","schema_version":"1.0","canonical_sha256":"c13547ec12451b0ec94c991fae5d09ff887f5e5cdcbf4839d407451ed00175dc","source":{"kind":"arxiv","id":"2310.18202","version":1},"attestation_state":"computed","paper":{"title":"Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Eoin Hurley, Freddie Illingworth, Lukas Michel","submitted_at":"2023-10-27T15:20:48Z","abstract_excerpt":"We prove that a large family of pairs of graphs satisfy a polynomial dependence in asymmetric graph removal lemmas. In particular, we give an unexpected answer to a question of Gishboliner, Shapira, and Wigderson by showing that for every $t \\geqslant 4$, there are $K_t$-abundant graphs of chromatic number $t$. Using similar methods, we also extend work of Ruzsa by proving that a set $\\mathcal{A} \\subset \\{1,\\dots,N\\}$ which avoids solutions with distinct integers to an equation of genus at least two has size $\\mathcal{O}(\\sqrt{N})$. The best previous bound was $N^{1 - o(1)}$ and the exponent "},"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":"2310.18202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-27T15:20:48Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"9fffc8a4965d9cb6ee3da39177e8442f9044a2d8a6f900380c6e923c61e68711","abstract_canon_sha256":"6255a278dffcbfba20e73e97900972251c83bcfd8c36c8da8d7f3c59ac879d09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:05:58.717678Z","signature_b64":"9dDtTgEuA7K/jImoyqiEiv3gWofKMNGhLTWxvQMDcsfTCG7GtY4JR4kmAVJBPg64SrTb2lALoA3FlYA9Qw7mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c13547ec12451b0ec94c991fae5d09ff887f5e5cdcbf4839d407451ed00175dc","last_reissued_at":"2026-07-05T07:05:58.717121Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:05:58.717121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Eoin Hurley, Freddie Illingworth, Lukas Michel","submitted_at":"2023-10-27T15:20:48Z","abstract_excerpt":"We prove that a large family of pairs of graphs satisfy a polynomial dependence in asymmetric graph removal lemmas. In particular, we give an unexpected answer to a question of Gishboliner, Shapira, and Wigderson by showing that for every $t \\geqslant 4$, there are $K_t$-abundant graphs of chromatic number $t$. Using similar methods, we also extend work of Ruzsa by proving that a set $\\mathcal{A} \\subset \\{1,\\dots,N\\}$ which avoids solutions with distinct integers to an equation of genus at least two has size $\\mathcal{O}(\\sqrt{N})$. The best previous bound was $N^{1 - o(1)}$ and the exponent "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18202","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/2310.18202/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":"2310.18202","created_at":"2026-07-05T07:05:58.717188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18202v1","created_at":"2026-07-05T07:05:58.717188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18202","created_at":"2026-07-05T07:05:58.717188+00:00"},{"alias_kind":"pith_short_12","alias_value":"YE2UP3ASIUNQ","created_at":"2026-07-05T07:05:58.717188+00:00"},{"alias_kind":"pith_short_16","alias_value":"YE2UP3ASIUNQ5SKM","created_at":"2026-07-05T07:05:58.717188+00:00"},{"alias_kind":"pith_short_8","alias_value":"YE2UP3AS","created_at":"2026-07-05T07:05:58.717188+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/YE2UP3ASIUNQ5SKMTEP24XIJ76","json":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76.json","graph_json":"https://pith.science/api/pith-number/YE2UP3ASIUNQ5SKMTEP24XIJ76/graph.json","events_json":"https://pith.science/api/pith-number/YE2UP3ASIUNQ5SKMTEP24XIJ76/events.json","paper":"https://pith.science/paper/YE2UP3AS"},"agent_actions":{"view_html":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76","download_json":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76.json","view_paper":"https://pith.science/paper/YE2UP3AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18202&json=true","fetch_graph":"https://pith.science/api/pith-number/YE2UP3ASIUNQ5SKMTEP24XIJ76/graph.json","fetch_events":"https://pith.science/api/pith-number/YE2UP3ASIUNQ5SKMTEP24XIJ76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/action/storage_attestation","attest_author":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/action/author_attestation","sign_citation":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/action/citation_signature","submit_replication":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/action/replication_record"}},"created_at":"2026-07-05T07:05:58.717188+00:00","updated_at":"2026-07-05T07:05:58.717188+00:00"}