{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SW4CLLISFSYQRDU5VBIJZN54O3","short_pith_number":"pith:SW4CLLIS","schema_version":"1.0","canonical_sha256":"95b825ad122cb1088e9da8509cb7bc76ecdb7cc848e0acb454ed85dc5be16043","source":{"kind":"arxiv","id":"2305.08567","version":1},"attestation_state":"computed","paper":{"title":"The sparse regularity method with Schatten norms and entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandru Pascadi","submitted_at":"2023-05-15T11:53:48Z","abstract_excerpt":"We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs, and also in graphs lacking a quasi-smooth family of bipartite subgraphs, extending results of Conlon, Fox, Sudakov and Zhao. We give some applications in additive combinatorics: one about translation-invariant linear equations in subsets of mildly-pseudorandom sets, one about such equations in generalized Sidon sets, and one about polygonal patterns in subset"},"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":"2305.08567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-05-15T11:53:48Z","cross_cats_sorted":[],"title_canon_sha256":"945e705016becdd33799c092c01baad7c4502e56a7a7295cf4817c0d342dc2fd","abstract_canon_sha256":"dcd2ddad75d7ba127d7a3080aa59a3e07bc80062dce79ee9befcb69c8c8b1b90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:03.445669Z","signature_b64":"UFD7St0xZDbjpuoS6hz4aBDJrIwMugbE09Og1g4C2JRx40a1ZP/xtzBtJFjva3W1wIZgECK83CN04fiD8cQVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b825ad122cb1088e9da8509cb7bc76ecdb7cc848e0acb454ed85dc5be16043","last_reissued_at":"2026-07-05T06:10:03.445200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:03.445200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sparse regularity method with Schatten norms and entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandru Pascadi","submitted_at":"2023-05-15T11:53:48Z","abstract_excerpt":"We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs, and also in graphs lacking a quasi-smooth family of bipartite subgraphs, extending results of Conlon, Fox, Sudakov and Zhao. We give some applications in additive combinatorics: one about translation-invariant linear equations in subsets of mildly-pseudorandom sets, one about such equations in generalized Sidon sets, and one about polygonal patterns in subset"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08567","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/2305.08567/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":"2305.08567","created_at":"2026-07-05T06:10:03.445254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08567v1","created_at":"2026-07-05T06:10:03.445254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08567","created_at":"2026-07-05T06:10:03.445254+00:00"},{"alias_kind":"pith_short_12","alias_value":"SW4CLLISFSYQ","created_at":"2026-07-05T06:10:03.445254+00:00"},{"alias_kind":"pith_short_16","alias_value":"SW4CLLISFSYQRDU5","created_at":"2026-07-05T06:10:03.445254+00:00"},{"alias_kind":"pith_short_8","alias_value":"SW4CLLIS","created_at":"2026-07-05T06:10:03.445254+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/SW4CLLISFSYQRDU5VBIJZN54O3","json":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3.json","graph_json":"https://pith.science/api/pith-number/SW4CLLISFSYQRDU5VBIJZN54O3/graph.json","events_json":"https://pith.science/api/pith-number/SW4CLLISFSYQRDU5VBIJZN54O3/events.json","paper":"https://pith.science/paper/SW4CLLIS"},"agent_actions":{"view_html":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3","download_json":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3.json","view_paper":"https://pith.science/paper/SW4CLLIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08567&json=true","fetch_graph":"https://pith.science/api/pith-number/SW4CLLISFSYQRDU5VBIJZN54O3/graph.json","fetch_events":"https://pith.science/api/pith-number/SW4CLLISFSYQRDU5VBIJZN54O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3/action/storage_attestation","attest_author":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3/action/author_attestation","sign_citation":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3/action/citation_signature","submit_replication":"https://pith.science/pith/SW4CLLISFSYQRDU5VBIJZN54O3/action/replication_record"}},"created_at":"2026-07-05T06:10:03.445254+00:00","updated_at":"2026-07-05T06:10:03.445254+00:00"}