{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RS6JAXRENNQCKCUCUTQZBEBDZ5","short_pith_number":"pith:RS6JAXRE","schema_version":"1.0","canonical_sha256":"8cbc905e246b60250a82a4e1909023cf6dd72d7203eee191623a1fa296b8f240","source":{"kind":"arxiv","id":"1507.01482","version":2},"attestation_state":"computed","paper":{"title":"Regularity lemma for distal structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Artem Chernikov, Sergei Starchenko","submitted_at":"2015-07-06T14:46:40Z","abstract_excerpt":"It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to a small error (e.g., see [33, 2, 16, 18]). We show that similar results can be obtained for families of graphs with the edge relation uniformly definable in a structure satisfying a certain model theoretic property called distality, with respect to a large class of generically stable measures. Moreover, distality characterizes these strong regularity proper"},"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":"1507.01482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2015-07-06T14:46:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d718f41e5769d0c4c1155ffd5f8635952da636ad186c8befa9f0bed143ca9d88","abstract_canon_sha256":"f9d7974c035fcf18b10a248e4dcc82a893eaa642c00b4bf578062b94ac41f298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:06.457541Z","signature_b64":"WEYGcQklCz+wDBXs8Z/5JZyRyekFqkF/k42n0u6A/tSvyvcQL8CWFL+agufX0Ffiv5F23yqDlgZ6yuOJlGLFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cbc905e246b60250a82a4e1909023cf6dd72d7203eee191623a1fa296b8f240","last_reissued_at":"2026-05-18T01:20:06.456843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:06.456843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularity lemma for distal structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Artem Chernikov, Sergei Starchenko","submitted_at":"2015-07-06T14:46:40Z","abstract_excerpt":"It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to a small error (e.g., see [33, 2, 16, 18]). We show that similar results can be obtained for families of graphs with the edge relation uniformly definable in a structure satisfying a certain model theoretic property called distality, with respect to a large class of generically stable measures. Moreover, distality characterizes these strong regularity proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01482","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":""},"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":"1507.01482","created_at":"2026-05-18T01:20:06.456981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01482v2","created_at":"2026-05-18T01:20:06.456981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01482","created_at":"2026-05-18T01:20:06.456981+00:00"},{"alias_kind":"pith_short_12","alias_value":"RS6JAXRENNQC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RS6JAXRENNQCKCUC","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RS6JAXRE","created_at":"2026-05-18T12:29:39.896362+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/RS6JAXRENNQCKCUCUTQZBEBDZ5","json":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5.json","graph_json":"https://pith.science/api/pith-number/RS6JAXRENNQCKCUCUTQZBEBDZ5/graph.json","events_json":"https://pith.science/api/pith-number/RS6JAXRENNQCKCUCUTQZBEBDZ5/events.json","paper":"https://pith.science/paper/RS6JAXRE"},"agent_actions":{"view_html":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5","download_json":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5.json","view_paper":"https://pith.science/paper/RS6JAXRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01482&json=true","fetch_graph":"https://pith.science/api/pith-number/RS6JAXRENNQCKCUCUTQZBEBDZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/RS6JAXRENNQCKCUCUTQZBEBDZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5/action/storage_attestation","attest_author":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5/action/author_attestation","sign_citation":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5/action/citation_signature","submit_replication":"https://pith.science/pith/RS6JAXRENNQCKCUCUTQZBEBDZ5/action/replication_record"}},"created_at":"2026-05-18T01:20:06.456981+00:00","updated_at":"2026-05-18T01:20:06.456981+00:00"}