{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GN7OCAOVIPJNGML7NRIWNC7WPS","short_pith_number":"pith:GN7OCAOV","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"},"canonical_sha256":"337ee101d543d2d3317f6c51668bf67ca0111f7125d837e298f4bbb1c848b48b","source":{"kind":"arxiv","id":"1810.02041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02041","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02041v2","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02041","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"GN7OCAOVIPJN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GN7OCAOVIPJNGML7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GN7OCAOV","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GN7OCAOVIPJNGML7NRIWNC7WPS","target":"record","payload":{"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"},"canonical_sha256":"337ee101d543d2d3317f6c51668bf67ca0111f7125d837e298f4bbb1c848b48b","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"},"source_kind":"arxiv","source_id":"1810.02041","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-18T00:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d99j4hu/bGbFtuEbzas5mNXtccGJCzEDdbmyFYMN7B0z8moYihGOLBMx4e/udpwD4pCWpiRvpm22chawDNp5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:02:47.072389Z"},"content_sha256":"967d97623f18300a08c854f6470098dec0a92ebaa76a4d3da3ba8ab9b30454a8","schema_version":"1.0","event_id":"sha256:967d97623f18300a08c854f6470098dec0a92ebaa76a4d3da3ba8ab9b30454a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GN7OCAOVIPJNGML7NRIWNC7WPS","target":"graph","payload":{"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"},"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:00:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsKA0pIW3eNGRFlj4qgKs1cc6yL5z9DMGB+QDHRweb2FWxCtNrMIaRII5b7fgUkNG0sI3ZiECqSqjzHjRujeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:02:47.072733Z"},"content_sha256":"d1dcb672126b35d225d01d39fe4e2a966dce8b41d4fc794e375a30f2863e18a4","schema_version":"1.0","event_id":"sha256:d1dcb672126b35d225d01d39fe4e2a966dce8b41d4fc794e375a30f2863e18a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/bundle.json","state_url":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/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-23T00:02:47Z","links":{"resolver":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS","bundle":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/bundle.json","state":"https://pith.science/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GN7OCAOVIPJNGML7NRIWNC7WPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GN7OCAOVIPJNGML7NRIWNC7WPS","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":"caf700513ce8a443157cf95174e5db5783d78609ed7cfdf7bed9a09b8ed467ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T03:39:49Z","title_canon_sha256":"c21c801568924a356a1e992384d33189dd6b65c6d5f4a00a3b7f073552c258b7"},"schema_version":"1.0","source":{"id":"1810.02041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02041","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02041v2","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02041","created_at":"2026-05-18T00:00:42Z"},{"alias_kind":"pith_short_12","alias_value":"GN7OCAOVIPJN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GN7OCAOVIPJNGML7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GN7OCAOV","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:d1dcb672126b35d225d01d39fe4e2a966dce8b41d4fc794e375a30f2863e18a4","target":"graph","created_at":"2026-05-18T00:00:42Z","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":"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_","authors_text":"Boris Pittel, H\\\"useyin Acan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T03:39:49Z","title":"On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02041","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:967d97623f18300a08c854f6470098dec0a92ebaa76a4d3da3ba8ab9b30454a8","target":"record","created_at":"2026-05-18T00:00:42Z","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":"caf700513ce8a443157cf95174e5db5783d78609ed7cfdf7bed9a09b8ed467ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-04T03:39:49Z","title_canon_sha256":"c21c801568924a356a1e992384d33189dd6b65c6d5f4a00a3b7f073552c258b7"},"schema_version":"1.0","source":{"id":"1810.02041","kind":"arxiv","version":2}},"canonical_sha256":"337ee101d543d2d3317f6c51668bf67ca0111f7125d837e298f4bbb1c848b48b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"337ee101d543d2d3317f6c51668bf67ca0111f7125d837e298f4bbb1c848b48b","first_computed_at":"2026-05-18T00:00:42.988026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:42.988026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+m21X9QoSWuHXW5U0ija1v9W+rWQh6tEHxf7ZpSQKRurJp5hQIMbo9J03vzvGPVMXpr4+CmknO+NjhT7mRrvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:42.988490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967d97623f18300a08c854f6470098dec0a92ebaa76a4d3da3ba8ab9b30454a8","sha256:d1dcb672126b35d225d01d39fe4e2a966dce8b41d4fc794e375a30f2863e18a4"],"state_sha256":"43a8bf879d9b9230c8207a97700254768f7053dbcada33c2ec40342e6b73896d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VPgfjUZU3Nrcy8QdvbvG7aYJAqC7ebASyaZFJZG/4GG0DOZamqiTiF2l8VCpaPS/K+1lD91EkFSCaAOYXBpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:02:47.074635Z","bundle_sha256":"4d1761093f8eab6e0f8f4941d6dcab197ee48a09e4acc0b55c183ae582bcf713"}}