{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YE2UP3ASIUNQ5SKMTEP24XIJ76","short_pith_number":"pith:YE2UP3AS","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"},"canonical_sha256":"c13547ec12451b0ec94c991fae5d09ff887f5e5cdcbf4839d407451ed00175dc","source":{"kind":"arxiv","id":"2310.18202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.18202","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2310.18202v1","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18202","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"YE2UP3ASIUNQ","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"YE2UP3ASIUNQ5SKM","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"YE2UP3AS","created_at":"2026-07-05T07:05:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YE2UP3ASIUNQ5SKMTEP24XIJ76","target":"record","payload":{"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"},"canonical_sha256":"c13547ec12451b0ec94c991fae5d09ff887f5e5cdcbf4839d407451ed00175dc","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"},"source_kind":"arxiv","source_id":"2310.18202","source_version":1,"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-07-05T07:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtY1Zv8+GKnFhNVetQ+plXX5coZW7PNe/2VimB8V0c5ziYy3jUMyjjA5lu2ASK3uV1Gwy6KxZTj63F3y6ieTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:15:27.357615Z"},"content_sha256":"9434b6a330393bbbcc28838285da5ad571291d04ce1c89df57edebdce19d01ab","schema_version":"1.0","event_id":"sha256:9434b6a330393bbbcc28838285da5ad571291d04ce1c89df57edebdce19d01ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YE2UP3ASIUNQ5SKMTEP24XIJ76","target":"graph","payload":{"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"},"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-07-05T07:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJ5Qos4bCCb3whbxrYfirzwpfLk2FcuUCil5LhcNv7qKBT8/2oRkhC0Y3E+Sxgs9jeGuD8tKy+T9ppg1qn81CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:15:27.357986Z"},"content_sha256":"e9efc367b392957f41959e5fa2499b65ef2bf04d64e21b63c121c05d1153b68c","schema_version":"1.0","event_id":"sha256:e9efc367b392957f41959e5fa2499b65ef2bf04d64e21b63c121c05d1153b68c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/bundle.json","state_url":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/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-07-07T11:15:27Z","links":{"resolver":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76","bundle":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/bundle.json","state":"https://pith.science/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YE2UP3ASIUNQ5SKMTEP24XIJ76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YE2UP3ASIUNQ5SKMTEP24XIJ76","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":"6255a278dffcbfba20e73e97900972251c83bcfd8c36c8da8d7f3c59ac879d09","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-27T15:20:48Z","title_canon_sha256":"9fffc8a4965d9cb6ee3da39177e8442f9044a2d8a6f900380c6e923c61e68711"},"schema_version":"1.0","source":{"id":"2310.18202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.18202","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2310.18202v1","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18202","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"YE2UP3ASIUNQ","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"YE2UP3ASIUNQ5SKM","created_at":"2026-07-05T07:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"YE2UP3AS","created_at":"2026-07-05T07:05:58Z"}],"graph_snapshots":[{"event_id":"sha256:e9efc367b392957f41959e5fa2499b65ef2bf04d64e21b63c121c05d1153b68c","target":"graph","created_at":"2026-07-05T07:05:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.18202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ant\\'onio Gir\\~ao, Eoin Hurley, Freddie Illingworth, Lukas Michel","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-27T15:20:48Z","title":"Abundance: Asymmetric Graph Removal Lemmas and Integer Solutions to Linear Equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18202","kind":"arxiv","version":1},"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:9434b6a330393bbbcc28838285da5ad571291d04ce1c89df57edebdce19d01ab","target":"record","created_at":"2026-07-05T07:05:58Z","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":"6255a278dffcbfba20e73e97900972251c83bcfd8c36c8da8d7f3c59ac879d09","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-27T15:20:48Z","title_canon_sha256":"9fffc8a4965d9cb6ee3da39177e8442f9044a2d8a6f900380c6e923c61e68711"},"schema_version":"1.0","source":{"id":"2310.18202","kind":"arxiv","version":1}},"canonical_sha256":"c13547ec12451b0ec94c991fae5d09ff887f5e5cdcbf4839d407451ed00175dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c13547ec12451b0ec94c991fae5d09ff887f5e5cdcbf4839d407451ed00175dc","first_computed_at":"2026-07-05T07:05:58.717121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:05:58.717121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9dDtTgEuA7K/jImoyqiEiv3gWofKMNGhLTWxvQMDcsfTCG7GtY4JR4kmAVJBPg64SrTb2lALoA3FlYA9Qw7mAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:05:58.717678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.18202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9434b6a330393bbbcc28838285da5ad571291d04ce1c89df57edebdce19d01ab","sha256:e9efc367b392957f41959e5fa2499b65ef2bf04d64e21b63c121c05d1153b68c"],"state_sha256":"1f34c0f934514b07aa4b2e64f4eb82bd5319526ba6adf3dce3a3497a340a8b1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgGtoqN2dmp8gD21fdPcKUFCbOEduzroKFSqm5RoQ2JVTr8LebcvC/iSNpbVhoxnfI3CesTUXS2a90j4K+MUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:15:27.360486Z","bundle_sha256":"da2df5d98cb770f686815314b83e5c763d0f13a1f8d464761e66830931abe463"}}