{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EQSQAHJYCJCF2DCJFE6OIGVS7D","short_pith_number":"pith:EQSQAHJY","schema_version":"1.0","canonical_sha256":"2425001d3812445d0c49293ce41ab2f8c123162b48025e7ce310678a94859b46","source":{"kind":"arxiv","id":"1205.3198","version":6},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1205.3198","created_at":"2026-05-18T00:47:31.793918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3198v6","created_at":"2026-05-18T00:47:31.793918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3198","created_at":"2026-05-18T00:47:31.793918+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQSQAHJYCJCF","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQSQAHJYCJCF2DCJ","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQSQAHJY","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D","json":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D.json","graph_json":"https://pith.science/api/pith-number/EQSQAHJYCJCF2DCJFE6OIGVS7D/graph.json","events_json":"https://pith.science/api/pith-number/EQSQAHJYCJCF2DCJFE6OIGVS7D/events.json","paper":"https://pith.science/paper/EQSQAHJY"},"agent_actions":{"view_html":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D","download_json":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D.json","view_paper":"https://pith.science/paper/EQSQAHJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3198&json=true","fetch_graph":"https://pith.science/api/pith-number/EQSQAHJYCJCF2DCJFE6OIGVS7D/graph.json","fetch_events":"https://pith.science/api/pith-number/EQSQAHJYCJCF2DCJFE6OIGVS7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/action/storage_attestation","attest_author":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/action/author_attestation","sign_citation":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/action/citation_signature","submit_replication":"https://pith.science/pith/EQSQAHJYCJCF2DCJFE6OIGVS7D/action/replication_record"}},"created_at":"2026-05-18T00:47:31.793918+00:00","updated_at":"2026-05-18T00:47:31.793918+00:00"}