{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GN7OCAOVIPJNGML7NRIWNC7WPS","short_pith_number":"pith:GN7OCAOV","schema_version":"1.0","canonical_sha256":"337ee101d543d2d3317f6c51668bf67ca0111f7125d837e298f4bbb1c848b48b","source":{"kind":"arxiv","id":"1810.02041","version":2},"attestation_state":"computed","paper":{"title":"On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, H\\\"useyin Acan","submitted_at":"2018-10-04T03:39:49Z","abstract_excerpt":"A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine the edge set. We study several aspects of this graph. Our motivation comes from two similarly constructed, well-studied random graphs: $k$-out graphs and preferential attachment graphs. In this paper, we find the asymptotic distribution of its minimum degree and connectivity, and study the expansion properties of $G_{n,k}$ to show that the conductance of $G_"},"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":"1810.02041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T03:39:49Z","cross_cats_sorted":[],"title_canon_sha256":"c21c801568924a356a1e992384d33189dd6b65c6d5f4a00a3b7f073552c258b7","abstract_canon_sha256":"caf700513ce8a443157cf95174e5db5783d78609ed7cfdf7bed9a09b8ed467ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.988490Z","signature_b64":"+m21X9QoSWuHXW5U0ija1v9W+rWQh6tEHxf7ZpSQKRurJp5hQIMbo9J03vzvGPVMXpr4+CmknO+NjhT7mRrvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337ee101d543d2d3317f6c51668bf67ca0111f7125d837e298f4bbb1c848b48b","last_reissued_at":"2026-05-18T00:00:42.988026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.988026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Pittel, H\\\"useyin Acan","submitted_at":"2018-10-04T03:39:49Z","abstract_excerpt":"A uniform attachment graph (with parameter $k$), denoted $G_{n,k}$ in the paper, is a random graph on the vertex set $[n]$, where each vertex $v$ makes $k$ selections from $[v-1]$ uniformly and independently, and these selections determine the edge set. We study several aspects of this graph. Our motivation comes from two similarly constructed, well-studied random graphs: $k$-out graphs and preferential attachment graphs. In this paper, we find the asymptotic distribution of its minimum degree and connectivity, and study the expansion properties of $G_{n,k}$ to show that the conductance of $G_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02041","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.02041","created_at":"2026-05-18T00:00:42.988085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02041v2","created_at":"2026-05-18T00:00:42.988085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02041","created_at":"2026-05-18T00:00:42.988085+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN7OCAOVIPJN","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN7OCAOVIPJNGML7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN7OCAOV","created_at":"2026-05-18T12:32:25.280505+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/GN7OCAOVIPJNGML7NRIWNC7WPS","json":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS.json","graph_json":"https://pith.science/api/pith-number/GN7OCAOVIPJNGML7NRIWNC7WPS/graph.json","events_json":"https://pith.science/api/pith-number/GN7OCAOVIPJNGML7NRIWNC7WPS/events.json","paper":"https://pith.science/paper/GN7OCAOV"},"agent_actions":{"view_html":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS","download_json":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS.json","view_paper":"https://pith.science/paper/GN7OCAOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02041&json=true","fetch_graph":"https://pith.science/api/pith-number/GN7OCAOVIPJNGML7NRIWNC7WPS/graph.json","fetch_events":"https://pith.science/api/pith-number/GN7OCAOVIPJNGML7NRIWNC7WPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/action/storage_attestation","attest_author":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/action/author_attestation","sign_citation":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/action/citation_signature","submit_replication":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/action/replication_record"}},"created_at":"2026-05-18T00:00:42.988085+00:00","updated_at":"2026-05-18T00:00:42.988085+00:00"}