{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HFXZACXRYTQPJHJMZUFBVDYNZJ","short_pith_number":"pith:HFXZACXR","canonical_record":{"source":{"id":"1512.08889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T09:47:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3ee83ed90d6c9c926a747bdcb7619099ba74da1d872edf7062852a679973e61b","abstract_canon_sha256":"e7bb55b907c9e25f3a233354b99727617fd7f3acd2acc3f4145632457ae0d68c"},"schema_version":"1.0"},"canonical_sha256":"396f900af1c4e0f49d2ccd0a1a8f0dca7fee775f0b0a906e64b6c2458218e31a","source":{"kind":"arxiv","id":"1512.08889","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08889","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08889v1","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08889","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFXZACXRYTQP","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HFXZACXRYTQPJHJM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HFXZACXR","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HFXZACXRYTQPJHJMZUFBVDYNZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.08889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T09:47:45Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"3ee83ed90d6c9c926a747bdcb7619099ba74da1d872edf7062852a679973e61b","abstract_canon_sha256":"e7bb55b907c9e25f3a233354b99727617fd7f3acd2acc3f4145632457ae0d68c"},"schema_version":"1.0"},"canonical_sha256":"396f900af1c4e0f49d2ccd0a1a8f0dca7fee775f0b0a906e64b6c2458218e31a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.847801Z","signature_b64":"z+yquqyF0CPWUIyuD20xk8wdpXXApss7PxLy8Kvcb+kFOPcSw+rGflKS27fdiL2I7WuJ8K+CSIOgROdA7mFLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396f900af1c4e0f49d2ccd0a1a8f0dca7fee775f0b0a906e64b6c2458218e31a","last_reissued_at":"2026-05-18T00:09:00.847242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.847242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.08889","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-05-18T00:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKTs+fzcAiO3f0iIZfNJLBnAYI9an+4v+uUfQeDU7TgMqe9TwFaxVfvGkAjyZOBkvPQZ4n0BiNvLKTWeilpyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:07:27.980031Z"},"content_sha256":"8e0ed614ca42e53510bee42e7e7597a8576421aa9c027e656b3a610a77e2a6c4","schema_version":"1.0","event_id":"sha256:8e0ed614ca42e53510bee42e7e7597a8576421aa9c027e656b3a610a77e2a6c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HFXZACXRYTQPJHJMZUFBVDYNZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraph statistics in subcritical graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Juanjo Ru\\'e, Lander Ramos, Michael Drmota","submitted_at":"2015-12-30T09:47:45Z","abstract_excerpt":"Let $H$ be a fixed graph and $\\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\\mathcal{G}$ follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of functional equations. As a case study, we get explicit expressions for the number of triangles and cycles of length four for the family of series-parallel graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08889","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":""},"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-05-18T00:09:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ze48iNpE9DzwUEmvwjJ4zOPlV+JgjQRKhAg6y35gkc7bw6NoE5VBbL+0+zMYQ6kl+wmRaj1YppoNYR+4TjBbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:07:27.980713Z"},"content_sha256":"ca08b9493e22e15ad4c8b8fcc3a287f2a77e653225d77192ab5854ba141ccd95","schema_version":"1.0","event_id":"sha256:ca08b9493e22e15ad4c8b8fcc3a287f2a77e653225d77192ab5854ba141ccd95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ/bundle.json","state_url":"https://pith.science/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ/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-05-25T21:07:27Z","links":{"resolver":"https://pith.science/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ","bundle":"https://pith.science/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ/bundle.json","state":"https://pith.science/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFXZACXRYTQPJHJMZUFBVDYNZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HFXZACXRYTQPJHJMZUFBVDYNZJ","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":"e7bb55b907c9e25f3a233354b99727617fd7f3acd2acc3f4145632457ae0d68c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T09:47:45Z","title_canon_sha256":"3ee83ed90d6c9c926a747bdcb7619099ba74da1d872edf7062852a679973e61b"},"schema_version":"1.0","source":{"id":"1512.08889","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08889","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08889v1","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08889","created_at":"2026-05-18T00:09:00Z"},{"alias_kind":"pith_short_12","alias_value":"HFXZACXRYTQP","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HFXZACXRYTQPJHJM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HFXZACXR","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:ca08b9493e22e15ad4c8b8fcc3a287f2a77e653225d77192ab5854ba141ccd95","target":"graph","created_at":"2026-05-18T00:09: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"},"paper":{"abstract_excerpt":"Let $H$ be a fixed graph and $\\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\\mathcal{G}$ follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of functional equations. As a case study, we get explicit expressions for the number of triangles and cycles of length four for the family of series-parallel graphs.","authors_text":"Juanjo Ru\\'e, Lander Ramos, Michael Drmota","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T09:47:45Z","title":"Subgraph statistics in subcritical graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08889","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:8e0ed614ca42e53510bee42e7e7597a8576421aa9c027e656b3a610a77e2a6c4","target":"record","created_at":"2026-05-18T00:09: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":"e7bb55b907c9e25f3a233354b99727617fd7f3acd2acc3f4145632457ae0d68c","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-30T09:47:45Z","title_canon_sha256":"3ee83ed90d6c9c926a747bdcb7619099ba74da1d872edf7062852a679973e61b"},"schema_version":"1.0","source":{"id":"1512.08889","kind":"arxiv","version":1}},"canonical_sha256":"396f900af1c4e0f49d2ccd0a1a8f0dca7fee775f0b0a906e64b6c2458218e31a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"396f900af1c4e0f49d2ccd0a1a8f0dca7fee775f0b0a906e64b6c2458218e31a","first_computed_at":"2026-05-18T00:09:00.847242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:00.847242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+yquqyF0CPWUIyuD20xk8wdpXXApss7PxLy8Kvcb+kFOPcSw+rGflKS27fdiL2I7WuJ8K+CSIOgROdA7mFLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:00.847801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08889","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e0ed614ca42e53510bee42e7e7597a8576421aa9c027e656b3a610a77e2a6c4","sha256:ca08b9493e22e15ad4c8b8fcc3a287f2a77e653225d77192ab5854ba141ccd95"],"state_sha256":"a34e92a8eb06460c76551b74472362c99b8ead7563e00b91ca0ce60db7262ecb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+bPznx56kBNex3McfIoAjzFqwiARRTGXkNvFm814n65z5y9q5CHf55IyUT2jxwxZ29qAbD3YCAYcDsjmAnDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:07:27.984355Z","bundle_sha256":"3f888e51610ad79b6248beda7ab0afa0e324ab588df71a81637a6cb7020e70db"}}