{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EQSQAHJYCJCF2DCJFE6OIGVS7D","short_pith_number":"pith:EQSQAHJY","canonical_record":{"source":{"id":"1205.3198","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-14T21:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"e975da543f16dd14f0cd05c5f6eb3c8d04275985664296e28daa8bb61eeb712e","abstract_canon_sha256":"d8c8304dbaff4bb95bbc2ade8793398cb65507b8d31fde73c9f10692ef884cb3"},"schema_version":"1.0"},"canonical_sha256":"2425001d3812445d0c49293ce41ab2f8c123162b48025e7ce310678a94859b46","source":{"kind":"arxiv","id":"1205.3198","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3198","created_at":"2026-05-18T00:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3198v6","created_at":"2026-05-18T00:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3198","created_at":"2026-05-18T00:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"EQSQAHJYCJCF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQSQAHJYCJCF2DCJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQSQAHJY","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EQSQAHJYCJCF2DCJFE6OIGVS7D","target":"record","payload":{"canonical_record":{"source":{"id":"1205.3198","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-14T21:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"e975da543f16dd14f0cd05c5f6eb3c8d04275985664296e28daa8bb61eeb712e","abstract_canon_sha256":"d8c8304dbaff4bb95bbc2ade8793398cb65507b8d31fde73c9f10692ef884cb3"},"schema_version":"1.0"},"canonical_sha256":"2425001d3812445d0c49293ce41ab2f8c123162b48025e7ce310678a94859b46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:31.794374Z","signature_b64":"jPiUB5R7wQkk1EMIF9aYx109ZWFm/mmRTBzJ/uFFUSFdrfBSR/gyNkbfM4dvsE5EbomQwRT3GvNw+z7FMrBCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2425001d3812445d0c49293ce41ab2f8c123162b48025e7ce310678a94859b46","last_reissued_at":"2026-05-18T00:47:31.793843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:31.793843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.3198","source_version":6,"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:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lv7b8wr6wm2aYVdncy0VNylvgSelgLsWr9DqlwVLCDuQZwybmoCJYtuWodlGtBgBM1F+JwQCmJpZZuRT1AenAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:46:26.353377Z"},"content_sha256":"9aa2adfa585b63c15a0c5fdef385761e2a1677f3e2bb33813f16d04af5979a12","schema_version":"1.0","event_id":"sha256:9aa2adfa585b63c15a0c5fdef385761e2a1677f3e2bb33813f16d04af5979a12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EQSQAHJYCJCF2DCJFE6OIGVS7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating infinite random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csaba Bir\\'o, Udayan B. Darji","submitted_at":"2012-05-14T21:11:44Z","abstract_excerpt":"We define a growing model of random graphs. Given a sequence of nonnegative integers $\\{d_n\\}_{n=0}^\\infty$ with the property that $d_i\\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\\ldots$ by the following process: vertex $v_i$ is connected to a subset of\n  $\\{v_0,\\ldots,v_{i-1}\\}$ of cardinality $d_i$ chosen uniformly at random. We study the resulting probability space. In particular, we give a new characterization of random graph and we also give probabilistic methods for constructing infinite random trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3198","kind":"arxiv","version":6},"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:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3Hk+Q0Ll8lX2N8+8St8boIcBYoZ29vA0aWeYDwHtZdGa1FIq7i+OjT4HDnpxPURoUdG3Fae3PvMX4ny51tsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:46:26.353749Z"},"content_sha256":"21090efd2938d987a53050f53f9b574aed82540a579d6fcc5cd9e2540a964731","schema_version":"1.0","event_id":"sha256:21090efd2938d987a53050f53f9b574aed82540a579d6fcc5cd9e2540a964731"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/bundle.json","state_url":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/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-06-01T03:46:26Z","links":{"resolver":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D","bundle":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/bundle.json","state":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EQSQAHJYCJCF2DCJFE6OIGVS7D","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":"d8c8304dbaff4bb95bbc2ade8793398cb65507b8d31fde73c9f10692ef884cb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-14T21:11:44Z","title_canon_sha256":"e975da543f16dd14f0cd05c5f6eb3c8d04275985664296e28daa8bb61eeb712e"},"schema_version":"1.0","source":{"id":"1205.3198","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.3198","created_at":"2026-05-18T00:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1205.3198v6","created_at":"2026-05-18T00:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3198","created_at":"2026-05-18T00:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"EQSQAHJYCJCF","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQSQAHJYCJCF2DCJ","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQSQAHJY","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:21090efd2938d987a53050f53f9b574aed82540a579d6fcc5cd9e2540a964731","target":"graph","created_at":"2026-05-18T00:47:31Z","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 define a growing model of random graphs. Given a sequence of nonnegative integers $\\{d_n\\}_{n=0}^\\infty$ with the property that $d_i\\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\\ldots$ by the following process: vertex $v_i$ is connected to a subset of\n  $\\{v_0,\\ldots,v_{i-1}\\}$ of cardinality $d_i$ chosen uniformly at random. We study the resulting probability space. In particular, we give a new characterization of random graph and we also give probabilistic methods for constructing infinite random trees.","authors_text":"Csaba Bir\\'o, Udayan B. Darji","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-14T21:11:44Z","title":"Generating infinite random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3198","kind":"arxiv","version":6},"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:9aa2adfa585b63c15a0c5fdef385761e2a1677f3e2bb33813f16d04af5979a12","target":"record","created_at":"2026-05-18T00:47:31Z","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":"d8c8304dbaff4bb95bbc2ade8793398cb65507b8d31fde73c9f10692ef884cb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-05-14T21:11:44Z","title_canon_sha256":"e975da543f16dd14f0cd05c5f6eb3c8d04275985664296e28daa8bb61eeb712e"},"schema_version":"1.0","source":{"id":"1205.3198","kind":"arxiv","version":6}},"canonical_sha256":"2425001d3812445d0c49293ce41ab2f8c123162b48025e7ce310678a94859b46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2425001d3812445d0c49293ce41ab2f8c123162b48025e7ce310678a94859b46","first_computed_at":"2026-05-18T00:47:31.793843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:31.793843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jPiUB5R7wQkk1EMIF9aYx109ZWFm/mmRTBzJ/uFFUSFdrfBSR/gyNkbfM4dvsE5EbomQwRT3GvNw+z7FMrBCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:31.794374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.3198","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9aa2adfa585b63c15a0c5fdef385761e2a1677f3e2bb33813f16d04af5979a12","sha256:21090efd2938d987a53050f53f9b574aed82540a579d6fcc5cd9e2540a964731"],"state_sha256":"6048864be60f283340fe704fcf9bdd3fba1efb6a3d43e7038c73bcb174720ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64N2uJkX8q4rT7eMQ95Yd68nYnLi1pWASoJXdGM8IZ3pgQPtoQa0Im4B+ZIV3dOKLWq8+sGZhY/UNbns2FhWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:46:26.355783Z","bundle_sha256":"ee8402775a8b791a495789d8b878f7473b7d140f4e6cfecc390261a892dd94cd"}}