{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2OOWL3EOWWFTHFJCLTQSNKVNKJ","short_pith_number":"pith:2OOWL3EO","canonical_record":{"source":{"id":"1311.5961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-23T05:04:39Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6815feb2df5f2aceefc70c6b31bba91e61b0f66233b4f7c9b8e16bdc4c9c747b","abstract_canon_sha256":"2398f8f74c868ff5c42714f3723c8561e0f0738b6aab1ae4c8c19e228f5f7933"},"schema_version":"1.0"},"canonical_sha256":"d39d65ec8eb58b3395225ce126aaad524974e3d0f29309ac4c0926af1255d8fa","source":{"kind":"arxiv","id":"1311.5961","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5961","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5961v2","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5961","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"2OOWL3EOWWFT","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2OOWL3EOWWFTHFJC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2OOWL3EO","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2OOWL3EOWWFTHFJCLTQSNKVNKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1311.5961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-23T05:04:39Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6815feb2df5f2aceefc70c6b31bba91e61b0f66233b4f7c9b8e16bdc4c9c747b","abstract_canon_sha256":"2398f8f74c868ff5c42714f3723c8561e0f0738b6aab1ae4c8c19e228f5f7933"},"schema_version":"1.0"},"canonical_sha256":"d39d65ec8eb58b3395225ce126aaad524974e3d0f29309ac4c0926af1255d8fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:40.335236Z","signature_b64":"zCU4pRYayznHjFXj4saEa6n270Il6AS6Zl0uGEG1p45yacHyaGz98NLy9JFdshcJEEn46IBzekKrZun6lHEdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d39d65ec8eb58b3395225ce126aaad524974e3d0f29309ac4c0926af1255d8fa","last_reissued_at":"2026-05-18T02:44:40.334612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:40.334612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.5961","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXibxW2wy0+4fSwn3+8QxckUdJSBo5QNBvCtuHGEmefxfzV7zdjbSBItqP3cc6o1LzhCUm6gi8H+I9IYH3aSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:30:03.138398Z"},"content_sha256":"74d59cf563e31fbe63bd1ab8adcf84ab442293673b26961507fd3d777b80ec49","schema_version":"1.0","event_id":"sha256:74d59cf563e31fbe63bd1ab8adcf84ab442293673b26961507fd3d777b80ec49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2OOWL3EOWWFTHFJCLTQSNKVNKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance between two random k-out digraphs, with and without preferential attachment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Boris Pittel, Nicholas R. Peterson","submitted_at":"2013-11-23T05:04:39Z","abstract_excerpt":"A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a \"preferential attachment\" rule: the current vertex selects an image i with probability proportional to a given parameter \\alpha = \\alpha(n) plus the number of times i has already been selected. Intuitively, the larger \\alpha gets, the closer the resulting k-out mapping is to the uniformly random k-out mapping. We prove that \\alpha = \\Theta(n^{1/2}) is the threshold for \\alpha growing \"fast enough\" to make the random digraph approach the uniformly random digraph in terms o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5961","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-18T02:44:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2v/U7IKC0ct9UzYkecUezPQFGwHxpvxnJJUcVfYas5M8KoTwBA7QlyZ9wulatoeImnCFUk85OF/tJczjt+YIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:30:03.138849Z"},"content_sha256":"0bafcd3ad575fcaab4c5890eef64c4fcd81c49a27185ceb1cec722675227dfaa","schema_version":"1.0","event_id":"sha256:0bafcd3ad575fcaab4c5890eef64c4fcd81c49a27185ceb1cec722675227dfaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ/bundle.json","state_url":"https://pith.science/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ/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-23T07:30:03Z","links":{"resolver":"https://pith.science/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ","bundle":"https://pith.science/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ/bundle.json","state":"https://pith.science/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OOWL3EOWWFTHFJCLTQSNKVNKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2OOWL3EOWWFTHFJCLTQSNKVNKJ","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":"2398f8f74c868ff5c42714f3723c8561e0f0738b6aab1ae4c8c19e228f5f7933","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-23T05:04:39Z","title_canon_sha256":"6815feb2df5f2aceefc70c6b31bba91e61b0f66233b4f7c9b8e16bdc4c9c747b"},"schema_version":"1.0","source":{"id":"1311.5961","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.5961","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"arxiv_version","alias_value":"1311.5961v2","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5961","created_at":"2026-05-18T02:44:40Z"},{"alias_kind":"pith_short_12","alias_value":"2OOWL3EOWWFT","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2OOWL3EOWWFTHFJC","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2OOWL3EO","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:0bafcd3ad575fcaab4c5890eef64c4fcd81c49a27185ceb1cec722675227dfaa","target":"graph","created_at":"2026-05-18T02:44:40Z","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 random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a \"preferential attachment\" rule: the current vertex selects an image i with probability proportional to a given parameter \\alpha = \\alpha(n) plus the number of times i has already been selected. Intuitively, the larger \\alpha gets, the closer the resulting k-out mapping is to the uniformly random k-out mapping. We prove that \\alpha = \\Theta(n^{1/2}) is the threshold for \\alpha growing \"fast enough\" to make the random digraph approach the uniformly random digraph in terms o","authors_text":"Boris Pittel, Nicholas R. Peterson","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-23T05:04:39Z","title":"Distance between two random k-out digraphs, with and without preferential attachment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5961","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:74d59cf563e31fbe63bd1ab8adcf84ab442293673b26961507fd3d777b80ec49","target":"record","created_at":"2026-05-18T02:44:40Z","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":"2398f8f74c868ff5c42714f3723c8561e0f0738b6aab1ae4c8c19e228f5f7933","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-23T05:04:39Z","title_canon_sha256":"6815feb2df5f2aceefc70c6b31bba91e61b0f66233b4f7c9b8e16bdc4c9c747b"},"schema_version":"1.0","source":{"id":"1311.5961","kind":"arxiv","version":2}},"canonical_sha256":"d39d65ec8eb58b3395225ce126aaad524974e3d0f29309ac4c0926af1255d8fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d39d65ec8eb58b3395225ce126aaad524974e3d0f29309ac4c0926af1255d8fa","first_computed_at":"2026-05-18T02:44:40.334612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:40.334612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCU4pRYayznHjFXj4saEa6n270Il6AS6Zl0uGEG1p45yacHyaGz98NLy9JFdshcJEEn46IBzekKrZun6lHEdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:40.335236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.5961","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74d59cf563e31fbe63bd1ab8adcf84ab442293673b26961507fd3d777b80ec49","sha256:0bafcd3ad575fcaab4c5890eef64c4fcd81c49a27185ceb1cec722675227dfaa"],"state_sha256":"d12c4c54a4f56c75aeebea5a82b307e5db37c81957f10fd14b395ee3c418f569"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HIks1W6ZUWUmxcZDfRU386z90EQ3YGEZE6hleoaXulXhnQuf4Z27puv7WxpQLYYdoNgqOY+p50k9Br9mUH12Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:30:03.141196Z","bundle_sha256":"c8ed4e98a9967ff863875d124a8f58f8f28e6d631657516e6e78706f255e6465"}}