{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KN4YHLISJVHP7UF2P3L6TRHZ6C","short_pith_number":"pith:KN4YHLIS","canonical_record":{"source":{"id":"1902.01823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-05T17:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"9bc7d599a30c806b9b89e2abd8107c1d20cf2aa46c553c40ecc0865f2d969a36","abstract_canon_sha256":"29bb25a2321283c319b2455e606e409b2f6e9f4e6311344cb55014522795aec0"},"schema_version":"1.0"},"canonical_sha256":"537983ad124d4effd0ba7ed7e9c4f9f0a63faff48bed6e43f87f421c8ac21272","source":{"kind":"arxiv","id":"1902.01823","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01823","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01823v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01823","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"KN4YHLISJVHP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KN4YHLISJVHP7UF2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KN4YHLIS","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KN4YHLISJVHP7UF2P3L6TRHZ6C","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01823","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-05T17:53:17Z","cross_cats_sorted":[],"title_canon_sha256":"9bc7d599a30c806b9b89e2abd8107c1d20cf2aa46c553c40ecc0865f2d969a36","abstract_canon_sha256":"29bb25a2321283c319b2455e606e409b2f6e9f4e6311344cb55014522795aec0"},"schema_version":"1.0"},"canonical_sha256":"537983ad124d4effd0ba7ed7e9c4f9f0a63faff48bed6e43f87f421c8ac21272","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.351222Z","signature_b64":"UnfuRJE0E6jfEEqDfh4D/mWy6aYBB3PKWHVmhpWiOuUyCRRXwkDbNmDZy0cZYLmge1PDPElkEankORH8feYbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"537983ad124d4effd0ba7ed7e9c4f9f0a63faff48bed6e43f87f421c8ac21272","last_reissued_at":"2026-05-17T23:53:49.350624Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.350624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01823","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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HtUu2cL7XofpjbdJiTkWC4gxASIPe0Db2HvyIuERIMuUn0S+5z3bTilyMbTuhxXgMm5zjZ8h/CmmBwaUle/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:30:01.551599Z"},"content_sha256":"906149137d43ee3a5090b33bcf09d9dc6a4667227312c03662570f55528f918e","schema_version":"1.0","event_id":"sha256:906149137d43ee3a5090b33bcf09d9dc6a4667227312c03662570f55528f918e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KN4YHLISJVHP7UF2P3L6TRHZ6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2-universality in randomly perturbed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olaf Parczyk","submitted_at":"2019-02-05T17:53:17Z","abstract_excerpt":"A graph $G$ is called universal for a family of graphs $\\mathcal{F}$ if it contains every element $F \\in \\mathcal{F}$ as a subgraph. Let $\\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh [Optimal Threshold for a Random Graph to be 2-Universal, to appear in Transactions of the American Mathematical Society] proved that there exists a $C$ such that for $p \\ge C (n^{-2/3} \\log^{1/3} n )$ the random graph $G(n,p)$ a.a.s is $\\mathcal{F}(n,2)$-universal, which is asymptotically optimal. For any $n$-vertex graph $G_\\alpha$ with minimum degree $\\delta("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01823","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-17T23:53:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzQmQi43KapJzy6iT6efz3s4b234pTX5oCtV7KVbzsR7i4bvH+Q36QC17+RSCA7l9MKRSO9WIamHs6AI8PVcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:30:01.552238Z"},"content_sha256":"16def6f8f009b1adea0fffd57c610970e2eb1f04176aa10c4228dad222f6250d","schema_version":"1.0","event_id":"sha256:16def6f8f009b1adea0fffd57c610970e2eb1f04176aa10c4228dad222f6250d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C/bundle.json","state_url":"https://pith.science/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C/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-11T03:30:01Z","links":{"resolver":"https://pith.science/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C","bundle":"https://pith.science/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C/bundle.json","state":"https://pith.science/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KN4YHLISJVHP7UF2P3L6TRHZ6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KN4YHLISJVHP7UF2P3L6TRHZ6C","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":"29bb25a2321283c319b2455e606e409b2f6e9f4e6311344cb55014522795aec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-05T17:53:17Z","title_canon_sha256":"9bc7d599a30c806b9b89e2abd8107c1d20cf2aa46c553c40ecc0865f2d969a36"},"schema_version":"1.0","source":{"id":"1902.01823","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01823","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01823v2","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01823","created_at":"2026-05-17T23:53:49Z"},{"alias_kind":"pith_short_12","alias_value":"KN4YHLISJVHP","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KN4YHLISJVHP7UF2","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KN4YHLIS","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:16def6f8f009b1adea0fffd57c610970e2eb1f04176aa10c4228dad222f6250d","target":"graph","created_at":"2026-05-17T23:53:49Z","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 graph $G$ is called universal for a family of graphs $\\mathcal{F}$ if it contains every element $F \\in \\mathcal{F}$ as a subgraph. Let $\\mathcal{F}(n,2)$ be the family of all graphs with maximum degree $2$. Ferber, Kronenberg, and Luh [Optimal Threshold for a Random Graph to be 2-Universal, to appear in Transactions of the American Mathematical Society] proved that there exists a $C$ such that for $p \\ge C (n^{-2/3} \\log^{1/3} n )$ the random graph $G(n,p)$ a.a.s is $\\mathcal{F}(n,2)$-universal, which is asymptotically optimal. For any $n$-vertex graph $G_\\alpha$ with minimum degree $\\delta(","authors_text":"Olaf Parczyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-05T17:53:17Z","title":"2-universality in randomly perturbed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01823","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:906149137d43ee3a5090b33bcf09d9dc6a4667227312c03662570f55528f918e","target":"record","created_at":"2026-05-17T23:53:49Z","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":"29bb25a2321283c319b2455e606e409b2f6e9f4e6311344cb55014522795aec0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-05T17:53:17Z","title_canon_sha256":"9bc7d599a30c806b9b89e2abd8107c1d20cf2aa46c553c40ecc0865f2d969a36"},"schema_version":"1.0","source":{"id":"1902.01823","kind":"arxiv","version":2}},"canonical_sha256":"537983ad124d4effd0ba7ed7e9c4f9f0a63faff48bed6e43f87f421c8ac21272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"537983ad124d4effd0ba7ed7e9c4f9f0a63faff48bed6e43f87f421c8ac21272","first_computed_at":"2026-05-17T23:53:49.350624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:49.350624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UnfuRJE0E6jfEEqDfh4D/mWy6aYBB3PKWHVmhpWiOuUyCRRXwkDbNmDZy0cZYLmge1PDPElkEankORH8feYbCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:49.351222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01823","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:906149137d43ee3a5090b33bcf09d9dc6a4667227312c03662570f55528f918e","sha256:16def6f8f009b1adea0fffd57c610970e2eb1f04176aa10c4228dad222f6250d"],"state_sha256":"99d676682b30ad9b270dc6db9e22297c22a062a185278963ffd21b281ff6a899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CY4JkRVcCejI8qd3+dQqPX/i8D9WaPUpM2gpneVKzILwDOWqlZHsL1Ihz9Rewx/zb0WvnaEa2Mw/f9VUnC8kCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:30:01.555899Z","bundle_sha256":"5cc6065f5fb655fbd379426dae5297fdff22326ad0f44ca6f977034c0694de80"}}