{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:AYQ3HYMAFCTNAOBINEORWYWGRO","short_pith_number":"pith:AYQ3HYMA","canonical_record":{"source":{"id":"1405.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-09T01:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"1ae30656be1a5a039e94b853760e185f08c045e6377228658461aecdb7755626","abstract_canon_sha256":"3ffc16d9e4eae644e23a5f69652f7279dba65b1dd75a5bfb38f1e7f5140cfd32"},"schema_version":"1.0"},"canonical_sha256":"0621b3e18028a6d03828691d1b62c68ba233fa87bc2131088c8e1160d8f4bd3c","source":{"kind":"arxiv","id":"1405.2129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2129","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2129v1","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2129","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"AYQ3HYMAFCTN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AYQ3HYMAFCTNAOBI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AYQ3HYMA","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:AYQ3HYMAFCTNAOBINEORWYWGRO","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-09T01:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"1ae30656be1a5a039e94b853760e185f08c045e6377228658461aecdb7755626","abstract_canon_sha256":"3ffc16d9e4eae644e23a5f69652f7279dba65b1dd75a5bfb38f1e7f5140cfd32"},"schema_version":"1.0"},"canonical_sha256":"0621b3e18028a6d03828691d1b62c68ba233fa87bc2131088c8e1160d8f4bd3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:13.593141Z","signature_b64":"24jei6qOL3i4XPd84L3WuVh+jPKskF7PjqrA7yDDPYevCnwHVDMxBwVJBvdYSkP0aB+caLu2TPL7/IM6llXCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0621b3e18028a6d03828691d1b62c68ba233fa87bc2131088c8e1160d8f4bd3c","last_reissued_at":"2026-05-18T02:52:13.592634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:13.592634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2129","source_version":1,"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:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t7JcIYrdMThs/l4GHU6nrQ77XhuJQnJFvVhBoAxlLOq5PoGbSyx1Y5GuZSiwjySOgwiERlo1CYspx/sG9xbpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:59:56.854226Z"},"content_sha256":"17820e888cb96487b8742b1fa0213cf224f1822d2f3c62c0b180a354d888b4d0","schema_version":"1.0","event_id":"sha256:17820e888cb96487b8742b1fa0213cf224f1822d2f3c62c0b180a354d888b4d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:AYQ3HYMAFCTNAOBINEORWYWGRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On random k-out sub-graphs of large graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Tony Johansson","submitted_at":"2014-05-09T01:29:08Z","abstract_excerpt":"We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\\in V$ independently chooses $k$ random neighbors, making $kn$ edges in all. When the minimum degree $\\delta(G)\\geq (\\frac12+\\epsilon)n,\\,n=|V|$ then $G_k$ is $k$-connected w.h.p. for $k=O(1)$; Hamiltonian for $k$ sufficiently large. When $\\delta(G) \\geq m$, then $G_k$ has a cycle of length $(1-\\epsilon)m$ for $k\\geq k_\\epsilon$. By w.h.p. we mean that the probability of non-occurrence can be bounded by a function $\\phi(n)$ (or $\\p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2129","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"},"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:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Olu8WKLQcw+6F3KXeq1VtWRk+JkpS64CjsI5lIrm00b7v0vxL54CqDLCGp574yCgl845sjbqdIGbFID5yxRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:59:56.854587Z"},"content_sha256":"2b7eb0d962d2a1f56d2136749ba729c8ceea6a3cb76dc5eead4f382a62437509","schema_version":"1.0","event_id":"sha256:2b7eb0d962d2a1f56d2136749ba729c8ceea6a3cb76dc5eead4f382a62437509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYQ3HYMAFCTNAOBINEORWYWGRO/bundle.json","state_url":"https://pith.science/pith/AYQ3HYMAFCTNAOBINEORWYWGRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYQ3HYMAFCTNAOBINEORWYWGRO/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-04T16:59:56Z","links":{"resolver":"https://pith.science/pith/AYQ3HYMAFCTNAOBINEORWYWGRO","bundle":"https://pith.science/pith/AYQ3HYMAFCTNAOBINEORWYWGRO/bundle.json","state":"https://pith.science/pith/AYQ3HYMAFCTNAOBINEORWYWGRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYQ3HYMAFCTNAOBINEORWYWGRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AYQ3HYMAFCTNAOBINEORWYWGRO","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":"3ffc16d9e4eae644e23a5f69652f7279dba65b1dd75a5bfb38f1e7f5140cfd32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-09T01:29:08Z","title_canon_sha256":"1ae30656be1a5a039e94b853760e185f08c045e6377228658461aecdb7755626"},"schema_version":"1.0","source":{"id":"1405.2129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2129","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2129v1","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2129","created_at":"2026-05-18T02:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"AYQ3HYMAFCTN","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AYQ3HYMAFCTNAOBI","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AYQ3HYMA","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:2b7eb0d962d2a1f56d2136749ba729c8ceea6a3cb76dc5eead4f382a62437509","target":"graph","created_at":"2026-05-18T02:52:13Z","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":"We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\\in V$ independently chooses $k$ random neighbors, making $kn$ edges in all. When the minimum degree $\\delta(G)\\geq (\\frac12+\\epsilon)n,\\,n=|V|$ then $G_k$ is $k$-connected w.h.p. for $k=O(1)$; Hamiltonian for $k$ sufficiently large. When $\\delta(G) \\geq m$, then $G_k$ has a cycle of length $(1-\\epsilon)m$ for $k\\geq k_\\epsilon$. By w.h.p. we mean that the probability of non-occurrence can be bounded by a function $\\phi(n)$ (or $\\p","authors_text":"Alan Frieze, Tony Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-09T01:29:08Z","title":"On random k-out sub-graphs of large graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2129","kind":"arxiv","version":1},"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:17820e888cb96487b8742b1fa0213cf224f1822d2f3c62c0b180a354d888b4d0","target":"record","created_at":"2026-05-18T02:52:13Z","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":"3ffc16d9e4eae644e23a5f69652f7279dba65b1dd75a5bfb38f1e7f5140cfd32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-09T01:29:08Z","title_canon_sha256":"1ae30656be1a5a039e94b853760e185f08c045e6377228658461aecdb7755626"},"schema_version":"1.0","source":{"id":"1405.2129","kind":"arxiv","version":1}},"canonical_sha256":"0621b3e18028a6d03828691d1b62c68ba233fa87bc2131088c8e1160d8f4bd3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0621b3e18028a6d03828691d1b62c68ba233fa87bc2131088c8e1160d8f4bd3c","first_computed_at":"2026-05-18T02:52:13.592634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:13.592634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"24jei6qOL3i4XPd84L3WuVh+jPKskF7PjqrA7yDDPYevCnwHVDMxBwVJBvdYSkP0aB+caLu2TPL7/IM6llXCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:13.593141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17820e888cb96487b8742b1fa0213cf224f1822d2f3c62c0b180a354d888b4d0","sha256:2b7eb0d962d2a1f56d2136749ba729c8ceea6a3cb76dc5eead4f382a62437509"],"state_sha256":"da08da7705746b6f384e3e850ad5122b0a2fa1c0bd5863d23d04b60d2807aa86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RrD4ruHogBAQaw9xx9o7cjfopRsQrDgLdAYb+BoluENHU5+o3mrOzO6UjExNuFC4klq2sE83Yv7JPyiB9pblAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:59:56.856634Z","bundle_sha256":"d9d077aa2d1fc6e2886a33d7d046f732acf5fd96a8f6c2c729af1a2554433a60"}}