{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:USKVTMYW4W6S26I6EWFOLDZP34","short_pith_number":"pith:USKVTMYW","schema_version":"1.0","canonical_sha256":"a49559b316e5bd2d791e258ae58f2fdf3c32a6c47945439d99f8e6207c67b685","source":{"kind":"arxiv","id":"2107.06706","version":2},"attestation_state":"computed","paper":{"title":"Accumulation points of the edit distance function","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Cox, Daniel McGinnis, Ryan R. Martin","submitted_at":"2021-07-14T13:50:30Z","abstract_excerpt":"Given a hereditary property $\\mathcal H$ of graphs and some $p\\in[0,1]$, the edit distance function $\\operatorname{ed}_{\\mathcal H}(p)$ is (asymptotically) the maximum proportion of \"edits\" (edge-additions plus edge-deletions) necessary to transform any graph of density $p$ into a member of $\\mathcal H$. For any fixed $p\\in[0,1]$, $\\operatorname{ed}_{\\mathcal H}(p)$ can be computed from an object known as a colored regularity graph (CRG). This paper is concerned with those points $p\\in[0,1]$ for which infinitely many CRGs are required to compute $\\operatorname{ed}_{\\mathcal H}$ on any open int"},"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":"2107.06706","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2021-07-14T13:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"7f0256c87555a9bd6a5b93713b6ca7d4f69dbe678687ebcf673f62308d23f4c1","abstract_canon_sha256":"1c6a7e23ffc274c15afd41abe9820f6dc17b37cd9074f14474a6a359b68371a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:29.973428Z","signature_b64":"hBRfCcGmV+/qzbFyZH7qTbh8GzxB/p6N6I8w2glqHhDpLO0WyjRAExEOP4h6z+Dxqv+3c8TU818uDkiboIWMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a49559b316e5bd2d791e258ae58f2fdf3c32a6c47945439d99f8e6207c67b685","last_reissued_at":"2026-07-05T03:56:29.972984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:29.972984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accumulation points of the edit distance function","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Cox, Daniel McGinnis, Ryan R. Martin","submitted_at":"2021-07-14T13:50:30Z","abstract_excerpt":"Given a hereditary property $\\mathcal H$ of graphs and some $p\\in[0,1]$, the edit distance function $\\operatorname{ed}_{\\mathcal H}(p)$ is (asymptotically) the maximum proportion of \"edits\" (edge-additions plus edge-deletions) necessary to transform any graph of density $p$ into a member of $\\mathcal H$. For any fixed $p\\in[0,1]$, $\\operatorname{ed}_{\\mathcal H}(p)$ can be computed from an object known as a colored regularity graph (CRG). This paper is concerned with those points $p\\in[0,1]$ for which infinitely many CRGs are required to compute $\\operatorname{ed}_{\\mathcal H}$ on any open int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.06706","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/2107.06706/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":"2107.06706","created_at":"2026-07-05T03:56:29.973038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.06706v2","created_at":"2026-07-05T03:56:29.973038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.06706","created_at":"2026-07-05T03:56:29.973038+00:00"},{"alias_kind":"pith_short_12","alias_value":"USKVTMYW4W6S","created_at":"2026-07-05T03:56:29.973038+00:00"},{"alias_kind":"pith_short_16","alias_value":"USKVTMYW4W6S26I6","created_at":"2026-07-05T03:56:29.973038+00:00"},{"alias_kind":"pith_short_8","alias_value":"USKVTMYW","created_at":"2026-07-05T03:56:29.973038+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/USKVTMYW4W6S26I6EWFOLDZP34","json":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34.json","graph_json":"https://pith.science/api/pith-number/USKVTMYW4W6S26I6EWFOLDZP34/graph.json","events_json":"https://pith.science/api/pith-number/USKVTMYW4W6S26I6EWFOLDZP34/events.json","paper":"https://pith.science/paper/USKVTMYW"},"agent_actions":{"view_html":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34","download_json":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34.json","view_paper":"https://pith.science/paper/USKVTMYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.06706&json=true","fetch_graph":"https://pith.science/api/pith-number/USKVTMYW4W6S26I6EWFOLDZP34/graph.json","fetch_events":"https://pith.science/api/pith-number/USKVTMYW4W6S26I6EWFOLDZP34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34/action/storage_attestation","attest_author":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34/action/author_attestation","sign_citation":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34/action/citation_signature","submit_replication":"https://pith.science/pith/USKVTMYW4W6S26I6EWFOLDZP34/action/replication_record"}},"created_at":"2026-07-05T03:56:29.973038+00:00","updated_at":"2026-07-05T03:56:29.973038+00:00"}