{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:REV7KYFWMIIIJA2H5C6E2WG2UH","short_pith_number":"pith:REV7KYFW","schema_version":"1.0","canonical_sha256":"892bf560b66210848347e8bc4d58daa1f6b308eaec95b830abf38f4e1de11068","source":{"kind":"arxiv","id":"2301.13607","version":3},"attestation_state":"computed","paper":{"title":"Graph classes with few $P_4$'s: Universality and Brownian graphon limits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Th\\'eo Lenoir","submitted_at":"2023-01-31T13:07:38Z","abstract_excerpt":"We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a Brownian limit object in the space of graphons. As a by-product we obtain new asymptotic enumerative results for all these graph classes. We also obtain typical density results for a wide variety of induced subgraphs. These asymptotics hold at a smaller scale than what is observable through the graphon convergence. Our proofs rely on tree encoding of graphs. We "},"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":"2301.13607","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2023-01-31T13:07:38Z","cross_cats_sorted":[],"title_canon_sha256":"b2ab70c166e274344f07640785e47861b4d9f607b77646b531458583e0d95587","abstract_canon_sha256":"34bb7ad1a1bf5ee91a34ef8cd4d1fd2319535b8c85e9bd5428c6b2c55571990c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:12.487299Z","signature_b64":"mOj8wMsKj+66N9TBlL/9OqJV9pvoEI3MClOhyCgPVaiA5/s9+4Cg9zDyNPk12SAC1R/guEaTqCL2T7Y1HzxDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"892bf560b66210848347e8bc4d58daa1f6b308eaec95b830abf38f4e1de11068","last_reissued_at":"2026-07-05T07:04:12.486772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:12.486772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph classes with few $P_4$'s: Universality and Brownian graphon limits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Th\\'eo Lenoir","submitted_at":"2023-01-31T13:07:38Z","abstract_excerpt":"We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a Brownian limit object in the space of graphons. As a by-product we obtain new asymptotic enumerative results for all these graph classes. We also obtain typical density results for a wide variety of induced subgraphs. These asymptotics hold at a smaller scale than what is observable through the graphon convergence. Our proofs rely on tree encoding of graphs. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13607","kind":"arxiv","version":3},"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/2301.13607/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":"2301.13607","created_at":"2026-07-05T07:04:12.486836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.13607v3","created_at":"2026-07-05T07:04:12.486836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13607","created_at":"2026-07-05T07:04:12.486836+00:00"},{"alias_kind":"pith_short_12","alias_value":"REV7KYFWMIII","created_at":"2026-07-05T07:04:12.486836+00:00"},{"alias_kind":"pith_short_16","alias_value":"REV7KYFWMIIIJA2H","created_at":"2026-07-05T07:04:12.486836+00:00"},{"alias_kind":"pith_short_8","alias_value":"REV7KYFW","created_at":"2026-07-05T07:04:12.486836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19123","citing_title":"The longest increasing subsequence of Brownian separable permutons","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH","json":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH.json","graph_json":"https://pith.science/api/pith-number/REV7KYFWMIIIJA2H5C6E2WG2UH/graph.json","events_json":"https://pith.science/api/pith-number/REV7KYFWMIIIJA2H5C6E2WG2UH/events.json","paper":"https://pith.science/paper/REV7KYFW"},"agent_actions":{"view_html":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH","download_json":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH.json","view_paper":"https://pith.science/paper/REV7KYFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.13607&json=true","fetch_graph":"https://pith.science/api/pith-number/REV7KYFWMIIIJA2H5C6E2WG2UH/graph.json","fetch_events":"https://pith.science/api/pith-number/REV7KYFWMIIIJA2H5C6E2WG2UH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH/action/storage_attestation","attest_author":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH/action/author_attestation","sign_citation":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH/action/citation_signature","submit_replication":"https://pith.science/pith/REV7KYFWMIIIJA2H5C6E2WG2UH/action/replication_record"}},"created_at":"2026-07-05T07:04:12.486836+00:00","updated_at":"2026-07-05T07:04:12.486836+00:00"}