{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:L2XQB7ET37JDCPCGNI2NKD5MQC","short_pith_number":"pith:L2XQB7ET","canonical_record":{"source":{"id":"2310.01318","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T16:26:44Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b690749f1917b104fb4783bedaf16ea8f74f203d642d7b6e1239a90244de0783","abstract_canon_sha256":"1ae2987731d0c3fbeaf63bd4890a58271bee58a4713340aeae7e3e3aed81335e"},"schema_version":"1.0"},"canonical_sha256":"5eaf00fc93dfd2313c466a34d50fac809b4d1a82d3e2c731f0584db1fac36f0a","source":{"kind":"arxiv","id":"2310.01318","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01318","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01318v2","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01318","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"L2XQB7ET37JD","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"pith_short_16","alias_value":"L2XQB7ET37JDCPCG","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"pith_short_8","alias_value":"L2XQB7ET","created_at":"2026-07-05T07:04:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:L2XQB7ET37JDCPCGNI2NKD5MQC","target":"record","payload":{"canonical_record":{"source":{"id":"2310.01318","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T16:26:44Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b690749f1917b104fb4783bedaf16ea8f74f203d642d7b6e1239a90244de0783","abstract_canon_sha256":"1ae2987731d0c3fbeaf63bd4890a58271bee58a4713340aeae7e3e3aed81335e"},"schema_version":"1.0"},"canonical_sha256":"5eaf00fc93dfd2313c466a34d50fac809b4d1a82d3e2c731f0584db1fac36f0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:00.580594Z","signature_b64":"99AaJzc1i22BfCwagk18IdDnnaCLJbiblQOjfN6keSpXHLS3ou1DBIbgjDcdp8pbiDQMf9iYDl9QalESWThWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eaf00fc93dfd2313c466a34d50fac809b4d1a82d3e2c731f0584db1fac36f0a","last_reissued_at":"2026-07-05T07:04:00.580018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:00.580018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.01318","source_version":2,"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:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nInL7mk8TCvDIabkiwYBlk4VeZ1EtbNBmh8xeIOdi/eCnAZRePAlKclbAXGkfRwybKNE+SBWyQeqBeUfksSoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:44:16.683356Z"},"content_sha256":"69e923b6cc17b7c0deb7ee902ddc21e89509e9c752c778fe986f6a666176494b","schema_version":"1.0","event_id":"sha256:69e923b6cc17b7c0deb7ee902ddc21e89509e9c752c778fe986f6a666176494b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:L2XQB7ET37JDCPCGNI2NKD5MQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Th\\'eo Lenoir","submitted_at":"2023-10-02T16:26:44Z","abstract_excerpt":"We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a consequence, we obtain the convergence of a uniform random graph in such classes to a Brownian limit object in the space of graphons.\n  Our proofs rely on combinatorial arguments, computing generating series using the symbolic method and deriving asymptotics using singularity analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01318","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/2310.01318/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:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZS8zyyxhnbe45vXdG2hsEkSugjId5bXkwodWYnw/QhgY689r1wmg8axfFln8Y9Oxg9+/xqBcZvy3gi+8FQRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T13:44:16.683731Z"},"content_sha256":"97a2e0e308c976b8b94f24da49367d936ac6851f859226da36316fa44723113c","schema_version":"1.0","event_id":"sha256:97a2e0e308c976b8b94f24da49367d936ac6851f859226da36316fa44723113c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2XQB7ET37JDCPCGNI2NKD5MQC/bundle.json","state_url":"https://pith.science/pith/L2XQB7ET37JDCPCGNI2NKD5MQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2XQB7ET37JDCPCGNI2NKD5MQC/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-08-22T13:44:16Z","links":{"resolver":"https://pith.science/pith/L2XQB7ET37JDCPCGNI2NKD5MQC","bundle":"https://pith.science/pith/L2XQB7ET37JDCPCGNI2NKD5MQC/bundle.json","state":"https://pith.science/pith/L2XQB7ET37JDCPCGNI2NKD5MQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2XQB7ET37JDCPCGNI2NKD5MQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:L2XQB7ET37JDCPCGNI2NKD5MQC","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":"1ae2987731d0c3fbeaf63bd4890a58271bee58a4713340aeae7e3e3aed81335e","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T16:26:44Z","title_canon_sha256":"b690749f1917b104fb4783bedaf16ea8f74f203d642d7b6e1239a90244de0783"},"schema_version":"1.0","source":{"id":"2310.01318","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01318","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01318v2","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01318","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"L2XQB7ET37JD","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"pith_short_16","alias_value":"L2XQB7ET37JDCPCG","created_at":"2026-07-05T07:04:00Z"},{"alias_kind":"pith_short_8","alias_value":"L2XQB7ET","created_at":"2026-07-05T07:04:00Z"}],"graph_snapshots":[{"event_id":"sha256:97a2e0e308c976b8b94f24da49367d936ac6851f859226da36316fa44723113c","target":"graph","created_at":"2026-07-05T07:04:00Z","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.01318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a consequence, we obtain the convergence of a uniform random graph in such classes to a Brownian limit object in the space of graphons.\n  Our proofs rely on combinatorial arguments, computing generating series using the symbolic method and deriving asymptotics using singularity analysis.","authors_text":"Th\\'eo Lenoir","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T16:26:44Z","title":"Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01318","kind":"arxiv","version":2},"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:69e923b6cc17b7c0deb7ee902ddc21e89509e9c752c778fe986f6a666176494b","target":"record","created_at":"2026-07-05T07:04:00Z","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":"1ae2987731d0c3fbeaf63bd4890a58271bee58a4713340aeae7e3e3aed81335e","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-02T16:26:44Z","title_canon_sha256":"b690749f1917b104fb4783bedaf16ea8f74f203d642d7b6e1239a90244de0783"},"schema_version":"1.0","source":{"id":"2310.01318","kind":"arxiv","version":2}},"canonical_sha256":"5eaf00fc93dfd2313c466a34d50fac809b4d1a82d3e2c731f0584db1fac36f0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5eaf00fc93dfd2313c466a34d50fac809b4d1a82d3e2c731f0584db1fac36f0a","first_computed_at":"2026-07-05T07:04:00.580018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:04:00.580018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"99AaJzc1i22BfCwagk18IdDnnaCLJbiblQOjfN6keSpXHLS3ou1DBIbgjDcdp8pbiDQMf9iYDl9QalESWThWCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:04:00.580594Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.01318","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69e923b6cc17b7c0deb7ee902ddc21e89509e9c752c778fe986f6a666176494b","sha256:97a2e0e308c976b8b94f24da49367d936ac6851f859226da36316fa44723113c"],"state_sha256":"fd687e740d0950675af5365caf1fa3b647b4db26fffd0952656d1db5668deb71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrpb+0+0qBox12pj3VComVxU+8hGhWHpCtzWsly/q4HdeA7QBLL3c5vwwJD0zUOxgtEnC0s7U6biuiEhknmVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T13:44:16.686249Z","bundle_sha256":"27cfff1f84453e29672dffb8470d78edcea9e4852331048e6ae93963b243b31d"}}