{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CSQRS26BX2YYWHTC7SGKZDFVYG","short_pith_number":"pith:CSQRS26B","schema_version":"1.0","canonical_sha256":"14a1196bc1beb18b1e62fc8cac8cb5c1865e180916d4a83dd9a98eaf409d689a","source":{"kind":"arxiv","id":"1509.06989","version":1},"attestation_state":"computed","paper":{"title":"Generating stationary random graphs on $\\mathbb{Z}$ with prescribed i.i.d.\\ degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maria Deijfen, Ronald Meester","submitted_at":"2015-09-23T14:02:49Z","abstract_excerpt":"Let $F$ be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set $\\mathbb{Z}$, so that the degrees of the vertices are i.i.d.\\ random variables with distribution $F$. Focus is on an algorithm where, initially, a random number of \"stubs\" with distribution $F$ is attached to each vertex. Each stub is then randomly assigned a direction, left or right, and the edge configuration is obtained by pairing stubs pointing to each other, first exhausting all possible connections between nearest neighbor"},"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":"1509.06989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-09-23T14:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"cbe888fca552acae2d54bad4efd453af842f2348cf77748bd584f48f51ef5639","abstract_canon_sha256":"13890c12a401a62ed76ac036b57cc1ab9d7df6d3d22b8faa74310c9ea809f719"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:17.301968Z","signature_b64":"0bLB1BrjosBGcTlb+tqhBgMZDsejkedXUmgJJ6e26bwUFADPaKrM6fMkE9Y5WVeQk3dBokO9/Rm//FQ2rmSuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14a1196bc1beb18b1e62fc8cac8cb5c1865e180916d4a83dd9a98eaf409d689a","last_reissued_at":"2026-05-18T01:32:17.301257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:17.301257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating stationary random graphs on $\\mathbb{Z}$ with prescribed i.i.d.\\ degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Maria Deijfen, Ronald Meester","submitted_at":"2015-09-23T14:02:49Z","abstract_excerpt":"Let $F$ be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set $\\mathbb{Z}$, so that the degrees of the vertices are i.i.d.\\ random variables with distribution $F$. Focus is on an algorithm where, initially, a random number of \"stubs\" with distribution $F$ is attached to each vertex. Each stub is then randomly assigned a direction, left or right, and the edge configuration is obtained by pairing stubs pointing to each other, first exhausting all possible connections between nearest neighbor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06989","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.06989","created_at":"2026-05-18T01:32:17.301360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06989v1","created_at":"2026-05-18T01:32:17.301360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06989","created_at":"2026-05-18T01:32:17.301360+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSQRS26BX2YY","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSQRS26BX2YYWHTC","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSQRS26B","created_at":"2026-05-18T12:29:17.054201+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/CSQRS26BX2YYWHTC7SGKZDFVYG","json":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG.json","graph_json":"https://pith.science/api/pith-number/CSQRS26BX2YYWHTC7SGKZDFVYG/graph.json","events_json":"https://pith.science/api/pith-number/CSQRS26BX2YYWHTC7SGKZDFVYG/events.json","paper":"https://pith.science/paper/CSQRS26B"},"agent_actions":{"view_html":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG","download_json":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG.json","view_paper":"https://pith.science/paper/CSQRS26B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06989&json=true","fetch_graph":"https://pith.science/api/pith-number/CSQRS26BX2YYWHTC7SGKZDFVYG/graph.json","fetch_events":"https://pith.science/api/pith-number/CSQRS26BX2YYWHTC7SGKZDFVYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG/action/storage_attestation","attest_author":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG/action/author_attestation","sign_citation":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG/action/citation_signature","submit_replication":"https://pith.science/pith/CSQRS26BX2YYWHTC7SGKZDFVYG/action/replication_record"}},"created_at":"2026-05-18T01:32:17.301360+00:00","updated_at":"2026-05-18T01:32:17.301360+00:00"}