{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DFTZPRU4YQ75INC5HC77IJHZBP","short_pith_number":"pith:DFTZPRU4","canonical_record":{"source":{"id":"2311.04184","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.PR","submitted_at":"2023-11-07T18:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"ebd4112ba539b9fc64a6471cce0a3522310e6c3601864c06698308594c90472a","abstract_canon_sha256":"4565397345a74b08f55a3d303c079f66ee1e90c354b4d12a2841d7494d8100f6"},"schema_version":"1.0"},"canonical_sha256":"196797c69cc43fd4345d38bff424f90bd6929f0b9ea5885b3935f85ba7c0db2c","source":{"kind":"arxiv","id":"2311.04184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.04184","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"2311.04184v1","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04184","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"DFTZPRU4YQ75","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_16","alias_value":"DFTZPRU4YQ75INC5","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_8","alias_value":"DFTZPRU4","created_at":"2026-07-05T09:46:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DFTZPRU4YQ75INC5HC77IJHZBP","target":"record","payload":{"canonical_record":{"source":{"id":"2311.04184","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.PR","submitted_at":"2023-11-07T18:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"ebd4112ba539b9fc64a6471cce0a3522310e6c3601864c06698308594c90472a","abstract_canon_sha256":"4565397345a74b08f55a3d303c079f66ee1e90c354b4d12a2841d7494d8100f6"},"schema_version":"1.0"},"canonical_sha256":"196797c69cc43fd4345d38bff424f90bd6929f0b9ea5885b3935f85ba7c0db2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:43.448217Z","signature_b64":"uVJDDpAw6U+d6x/if6hHhm/+3EXkwe3/wU0Wqc/Gkx7zyR+odAf9izbEmDdjJMe4qjSISMJQClbq0CMezgqMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"196797c69cc43fd4345d38bff424f90bd6929f0b9ea5885b3935f85ba7c0db2c","last_reissued_at":"2026-07-05T09:46:43.447719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:43.447719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.04184","source_version":1,"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-05T09:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FVr6Zw0EuTbDaNJzhupufHxJlotgV4X3N9vorDLiN7RLh/6vj2mDRflUBVIK9kqGJgUmwx+PEMP5S7qO/jkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T17:28:08.481177Z"},"content_sha256":"9b45e5f94d79ce9d250cb8fdb85f71762998998ed8be60b33cfd5424cccd44a8","schema_version":"1.0","event_id":"sha256:9b45e5f94d79ce9d250cb8fdb85f71762998998ed8be60b33cfd5424cccd44a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DFTZPRU4YQ75INC5HC77IJHZBP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of Subgraph Counts in the Uniform Attachment Model","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Cecilia Holmgren, Johan Bj\\\"orklund, Svante Janson, Tiffany Y. Y. Lo","submitted_at":"2023-11-07T18:26:02Z","abstract_excerpt":"We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and multi-variate Poisson approximations to the counts of cycles, and normal approximations to the counts of unicyclic subgraphs; we also give a partial result for the counts of trees. We further find a class of multicyclic graphs whose subgraph counts are a.s. bounded as $n\\to\\infty$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04184","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/2311.04184/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-05T09:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqHizNd9Dy4ZZ2XlE2c9Um0HsJ1/wTdrri+YDj7xtihKeQYKRQAEbneFq6j9obe9XfzxR/j2i5xxCi1ao7S2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T17:28:08.481561Z"},"content_sha256":"1295cd98039de203830ca421a0cdaeeb8ff4ea198483f1df7e18d8d4a173c814","schema_version":"1.0","event_id":"sha256:1295cd98039de203830ca421a0cdaeeb8ff4ea198483f1df7e18d8d4a173c814"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DFTZPRU4YQ75INC5HC77IJHZBP/bundle.json","state_url":"https://pith.science/pith/DFTZPRU4YQ75INC5HC77IJHZBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DFTZPRU4YQ75INC5HC77IJHZBP/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-07-13T17:28:08Z","links":{"resolver":"https://pith.science/pith/DFTZPRU4YQ75INC5HC77IJHZBP","bundle":"https://pith.science/pith/DFTZPRU4YQ75INC5HC77IJHZBP/bundle.json","state":"https://pith.science/pith/DFTZPRU4YQ75INC5HC77IJHZBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DFTZPRU4YQ75INC5HC77IJHZBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DFTZPRU4YQ75INC5HC77IJHZBP","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":"4565397345a74b08f55a3d303c079f66ee1e90c354b4d12a2841d7494d8100f6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.PR","submitted_at":"2023-11-07T18:26:02Z","title_canon_sha256":"ebd4112ba539b9fc64a6471cce0a3522310e6c3601864c06698308594c90472a"},"schema_version":"1.0","source":{"id":"2311.04184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.04184","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"2311.04184v1","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.04184","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"DFTZPRU4YQ75","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_16","alias_value":"DFTZPRU4YQ75INC5","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_8","alias_value":"DFTZPRU4","created_at":"2026-07-05T09:46:43Z"}],"graph_snapshots":[{"event_id":"sha256:1295cd98039de203830ca421a0cdaeeb8ff4ea198483f1df7e18d8d4a173c814","target":"graph","created_at":"2026-07-05T09:46:43Z","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/2311.04184/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We use Stein's method to obtain distributional approximations of subgraph counts in the uniform attachment model or random directed acyclic graph; we provide also estimates of rates of convergence. In particular, we give uni- and multi-variate Poisson approximations to the counts of cycles, and normal approximations to the counts of unicyclic subgraphs; we also give a partial result for the counts of trees. We further find a class of multicyclic graphs whose subgraph counts are a.s. bounded as $n\\to\\infty$.","authors_text":"Cecilia Holmgren, Johan Bj\\\"orklund, Svante Janson, Tiffany Y. Y. Lo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.PR","submitted_at":"2023-11-07T18:26:02Z","title":"Approximation of Subgraph Counts in the Uniform Attachment Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.04184","kind":"arxiv","version":1},"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:9b45e5f94d79ce9d250cb8fdb85f71762998998ed8be60b33cfd5424cccd44a8","target":"record","created_at":"2026-07-05T09:46:43Z","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":"4565397345a74b08f55a3d303c079f66ee1e90c354b4d12a2841d7494d8100f6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.PR","submitted_at":"2023-11-07T18:26:02Z","title_canon_sha256":"ebd4112ba539b9fc64a6471cce0a3522310e6c3601864c06698308594c90472a"},"schema_version":"1.0","source":{"id":"2311.04184","kind":"arxiv","version":1}},"canonical_sha256":"196797c69cc43fd4345d38bff424f90bd6929f0b9ea5885b3935f85ba7c0db2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"196797c69cc43fd4345d38bff424f90bd6929f0b9ea5885b3935f85ba7c0db2c","first_computed_at":"2026-07-05T09:46:43.447719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:46:43.447719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uVJDDpAw6U+d6x/if6hHhm/+3EXkwe3/wU0Wqc/Gkx7zyR+odAf9izbEmDdjJMe4qjSISMJQClbq0CMezgqMDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:46:43.448217Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.04184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b45e5f94d79ce9d250cb8fdb85f71762998998ed8be60b33cfd5424cccd44a8","sha256:1295cd98039de203830ca421a0cdaeeb8ff4ea198483f1df7e18d8d4a173c814"],"state_sha256":"f811cc896ac222c88baf0e29f9162ac2cc485fd5d3ba4ddbcff646013288d40e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlSHnY+7yN58MFKcApJZATMuI307KZcnISX+dH2fkT8TOIRkpgpOr1F7WbWJEJL+JzPdyk9v8IIsKoyx8nNOAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T17:28:08.483536Z","bundle_sha256":"03958fc8b0490e0cd6684b8b37fbbfa47bf6417a9db9ab68cf3ab39704c23153"}}