{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4OPEQBJJRBDFQAHUFG6AHHTIUM","short_pith_number":"pith:4OPEQBJJ","canonical_record":{"source":{"id":"1206.4586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T19:39:58Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"0f40950ca33cf475c2f46116d00a3c4412a58dcc270a62418c122143d6a63874","abstract_canon_sha256":"dc99b586a61152c6d0878b71573e8fa955d36a563dc2efea315f54ba58fb5bd5"},"schema_version":"1.0"},"canonical_sha256":"e39e48052988465800f429bc039e68a300252cd932b7a32a110d74a562c4aa97","source":{"kind":"arxiv","id":"1206.4586","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4586","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4586v2","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4586","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"4OPEQBJJRBDF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4OPEQBJJRBDFQAHU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4OPEQBJJ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4OPEQBJJRBDFQAHUFG6AHHTIUM","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T19:39:58Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"0f40950ca33cf475c2f46116d00a3c4412a58dcc270a62418c122143d6a63874","abstract_canon_sha256":"dc99b586a61152c6d0878b71573e8fa955d36a563dc2efea315f54ba58fb5bd5"},"schema_version":"1.0"},"canonical_sha256":"e39e48052988465800f429bc039e68a300252cd932b7a32a110d74a562c4aa97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:32.059429Z","signature_b64":"S5wDdea9i4zZPaEd3TLgjhwBJP/9jWjLrjoCeQfyZ+rVSvmxPcVYVxF04rc33C68blnnmExCf9KGcLAPBjSLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e39e48052988465800f429bc039e68a300252cd932b7a32a110d74a562c4aa97","last_reissued_at":"2026-05-18T03:07:32.058992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:32.058992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4586","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-05-18T03:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nu7/MIzJCVBDf3p7s3xipvwsspv2J4VTp1Zz0f2hWRQcE/TywP1EAvEkeoTjOEK6JQ5ORDvv8e8c0D6pBH6HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:44:40.195496Z"},"content_sha256":"226a0df6cc4b95342e9cf94b81517b8aece7de81120dbdfe4408f36b8755d187","schema_version":"1.0","event_id":"sha256:226a0df6cc4b95342e9cf94b81517b8aece7de81120dbdfe4408f36b8755d187"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4OPEQBJJRBDFQAHUFG6AHHTIUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An example of graph limits of growing sequences of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"math.CO","authors_text":"Simone Severini, Svante Janson","submitted_at":"2012-06-20T19:39:58Z","abstract_excerpt":"We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary distribution, depending on the number of existing vertices. Examples from this class turn out to be the ER random graph, a natural random threshold graph, etc. By working with the notion of graph limits, we define a kernel which, under certain conditions, is the limit of the growing random graph. Moreover, for a subclass of models, the growing graph on any give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4586","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":""},"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-18T03:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84M9fLK4hAZzAf1nPdxFanvQKMpntSEoLxER5bCn7a348y/UV6LdA4jPlRRHper1t6j/2k1GE7Z5RbjDAWbSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:44:40.195936Z"},"content_sha256":"5a8f150c97f5260559c1ab0cfc0b8c5530c69ccfa3bb8bdd9d0d07bc38b44064","schema_version":"1.0","event_id":"sha256:5a8f150c97f5260559c1ab0cfc0b8c5530c69ccfa3bb8bdd9d0d07bc38b44064"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM/bundle.json","state_url":"https://pith.science/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM/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-25T22:44:40Z","links":{"resolver":"https://pith.science/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM","bundle":"https://pith.science/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM/bundle.json","state":"https://pith.science/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OPEQBJJRBDFQAHUFG6AHHTIUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4OPEQBJJRBDFQAHUFG6AHHTIUM","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":"dc99b586a61152c6d0878b71573e8fa955d36a563dc2efea315f54ba58fb5bd5","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T19:39:58Z","title_canon_sha256":"0f40950ca33cf475c2f46116d00a3c4412a58dcc270a62418c122143d6a63874"},"schema_version":"1.0","source":{"id":"1206.4586","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4586","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4586v2","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4586","created_at":"2026-05-18T03:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"4OPEQBJJRBDF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4OPEQBJJRBDFQAHU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4OPEQBJJ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:5a8f150c97f5260559c1ab0cfc0b8c5530c69ccfa3bb8bdd9d0d07bc38b44064","target":"graph","created_at":"2026-05-18T03:07:32Z","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":"We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary distribution, depending on the number of existing vertices. Examples from this class turn out to be the ER random graph, a natural random threshold graph, etc. By working with the notion of graph limits, we define a kernel which, under certain conditions, is the limit of the growing random graph. Moreover, for a subclass of models, the growing graph on any give","authors_text":"Simone Severini, Svante Janson","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T19:39:58Z","title":"An example of graph limits of growing sequences of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4586","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:226a0df6cc4b95342e9cf94b81517b8aece7de81120dbdfe4408f36b8755d187","target":"record","created_at":"2026-05-18T03:07:32Z","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":"dc99b586a61152c6d0878b71573e8fa955d36a563dc2efea315f54ba58fb5bd5","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-20T19:39:58Z","title_canon_sha256":"0f40950ca33cf475c2f46116d00a3c4412a58dcc270a62418c122143d6a63874"},"schema_version":"1.0","source":{"id":"1206.4586","kind":"arxiv","version":2}},"canonical_sha256":"e39e48052988465800f429bc039e68a300252cd932b7a32a110d74a562c4aa97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e39e48052988465800f429bc039e68a300252cd932b7a32a110d74a562c4aa97","first_computed_at":"2026-05-18T03:07:32.058992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:32.058992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S5wDdea9i4zZPaEd3TLgjhwBJP/9jWjLrjoCeQfyZ+rVSvmxPcVYVxF04rc33C68blnnmExCf9KGcLAPBjSLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:32.059429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4586","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:226a0df6cc4b95342e9cf94b81517b8aece7de81120dbdfe4408f36b8755d187","sha256:5a8f150c97f5260559c1ab0cfc0b8c5530c69ccfa3bb8bdd9d0d07bc38b44064"],"state_sha256":"124e800702006121e6a4aba7f6c94d4b2f77afa414fdce7f71e853ccf202da70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"psxP8PS49mGEJDeaDedMj07o0yRrv52cqGeLyfNZ5QG0rZmBK1l8m261kDn5YutT+S9gVaLEzB5d7gu0pN5fAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:44:40.198763Z","bundle_sha256":"c9e793527221774886c035226144bec15d6afe2083997b9d049eb48646aaf26d"}}