{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CPK3JIPLK4YWHAAD5PZHIN7DQM","short_pith_number":"pith:CPK3JIPL","canonical_record":{"source":{"id":"1805.08744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-22T17:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"5e96abd6c9d41f371363abcf6f0ed9deeda849034d6193dc57e2cad2e4e38a5d","abstract_canon_sha256":"f53517a0f06d9b9e4a27a9ef2fc9b40eb5090d08de7d5f8a57a3a40bbcc84cd4"},"schema_version":"1.0"},"canonical_sha256":"13d5b4a1eb5731638003ebf27437e38321af9a05bf5c0dd2c7199ed7900a0515","source":{"kind":"arxiv","id":"1805.08744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08744","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08744v2","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08744","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"CPK3JIPLK4YW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CPK3JIPLK4YWHAAD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CPK3JIPL","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CPK3JIPLK4YWHAAD5PZHIN7DQM","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-22T17:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"5e96abd6c9d41f371363abcf6f0ed9deeda849034d6193dc57e2cad2e4e38a5d","abstract_canon_sha256":"f53517a0f06d9b9e4a27a9ef2fc9b40eb5090d08de7d5f8a57a3a40bbcc84cd4"},"schema_version":"1.0"},"canonical_sha256":"13d5b4a1eb5731638003ebf27437e38321af9a05bf5c0dd2c7199ed7900a0515","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:36.233936Z","signature_b64":"in1Uu/rcoldlyFMhzTZ5OWPQXASvABKUuAxCpqo1fJgc8v/AY1KjFMFSF9e3DZZ1XIRhHhumRYyAioheZkdBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13d5b4a1eb5731638003ebf27437e38321af9a05bf5c0dd2c7199ed7900a0515","last_reissued_at":"2026-05-17T23:47:36.233511Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:36.233511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08744","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:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLJSp9moKd2jUpriS4/auQJ6msaiOodgthdy8NHUEwpeULYSDEt7+ypKgB2WW6QhV1PlE20PggHLDNGJgVbYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:54:27.989007Z"},"content_sha256":"86030053b5bc558977f756a2a2470f01ddbe3f1cf0241244e5727a8ddf6260a1","schema_version":"1.0","event_id":"sha256:86030053b5bc558977f756a2a2470f01ddbe3f1cf0241244e5727a8ddf6260a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CPK3JIPLK4YWHAAD5PZHIN7DQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On resilience of connectivity in the evolution of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luc Haller, Milo\\v{s} Truji\\'c","submitted_at":"2018-05-22T17:08:36Z","abstract_excerpt":"In this note we establish a resilience version of the classical hitting time result of Bollob\\'{a}s and Thomason regarding connectivity. A graph $G$ is said to be $\\alpha$-resilient with respect to a monotone increasing graph property $\\mathcal{P}$ if for every spanning subgraph $H \\subseteq G$ satisfying $\\mathrm{deg}_H(v) \\leq \\alpha \\cdot \\mathrm{deg}_G(v)$ for all $v \\in V(G)$, the graph $G - H$ still possesses $\\mathcal{P}$. Let $\\{G_i\\}$ be the random graph process, that is a process where, starting with an empty graph on $n$ vertices $G_0$, in each step $i \\geq 1$ an edge $e$ is chosen "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08744","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:47:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36bcHBMX237Zchwr8pmgfvEuhLvzN+NIBTCgnHDtm/If9w6iFDdNwqYyxWpJ6Z+Sw3+TVW9SIoNNK/6gkVZZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:54:27.989700Z"},"content_sha256":"146ca98a0006157648bb45b54dc564cd61bd0f0fdb3e9c109d81463de4c0c654","schema_version":"1.0","event_id":"sha256:146ca98a0006157648bb45b54dc564cd61bd0f0fdb3e9c109d81463de4c0c654"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM/bundle.json","state_url":"https://pith.science/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM/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-10T23:54:27Z","links":{"resolver":"https://pith.science/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM","bundle":"https://pith.science/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM/bundle.json","state":"https://pith.science/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPK3JIPLK4YWHAAD5PZHIN7DQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CPK3JIPLK4YWHAAD5PZHIN7DQM","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":"f53517a0f06d9b9e4a27a9ef2fc9b40eb5090d08de7d5f8a57a3a40bbcc84cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-22T17:08:36Z","title_canon_sha256":"5e96abd6c9d41f371363abcf6f0ed9deeda849034d6193dc57e2cad2e4e38a5d"},"schema_version":"1.0","source":{"id":"1805.08744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08744","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08744v2","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08744","created_at":"2026-05-17T23:47:36Z"},{"alias_kind":"pith_short_12","alias_value":"CPK3JIPLK4YW","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CPK3JIPLK4YWHAAD","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CPK3JIPL","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:146ca98a0006157648bb45b54dc564cd61bd0f0fdb3e9c109d81463de4c0c654","target":"graph","created_at":"2026-05-17T23:47:36Z","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":"In this note we establish a resilience version of the classical hitting time result of Bollob\\'{a}s and Thomason regarding connectivity. A graph $G$ is said to be $\\alpha$-resilient with respect to a monotone increasing graph property $\\mathcal{P}$ if for every spanning subgraph $H \\subseteq G$ satisfying $\\mathrm{deg}_H(v) \\leq \\alpha \\cdot \\mathrm{deg}_G(v)$ for all $v \\in V(G)$, the graph $G - H$ still possesses $\\mathcal{P}$. Let $\\{G_i\\}$ be the random graph process, that is a process where, starting with an empty graph on $n$ vertices $G_0$, in each step $i \\geq 1$ an edge $e$ is chosen ","authors_text":"Luc Haller, Milo\\v{s} Truji\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-22T17:08:36Z","title":"On resilience of connectivity in the evolution of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08744","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:86030053b5bc558977f756a2a2470f01ddbe3f1cf0241244e5727a8ddf6260a1","target":"record","created_at":"2026-05-17T23:47:36Z","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":"f53517a0f06d9b9e4a27a9ef2fc9b40eb5090d08de7d5f8a57a3a40bbcc84cd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-22T17:08:36Z","title_canon_sha256":"5e96abd6c9d41f371363abcf6f0ed9deeda849034d6193dc57e2cad2e4e38a5d"},"schema_version":"1.0","source":{"id":"1805.08744","kind":"arxiv","version":2}},"canonical_sha256":"13d5b4a1eb5731638003ebf27437e38321af9a05bf5c0dd2c7199ed7900a0515","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13d5b4a1eb5731638003ebf27437e38321af9a05bf5c0dd2c7199ed7900a0515","first_computed_at":"2026-05-17T23:47:36.233511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:36.233511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"in1Uu/rcoldlyFMhzTZ5OWPQXASvABKUuAxCpqo1fJgc8v/AY1KjFMFSF9e3DZZ1XIRhHhumRYyAioheZkdBAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:36.233936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86030053b5bc558977f756a2a2470f01ddbe3f1cf0241244e5727a8ddf6260a1","sha256:146ca98a0006157648bb45b54dc564cd61bd0f0fdb3e9c109d81463de4c0c654"],"state_sha256":"8f05681fd94ecba5514fbc7c8af88fb521209f7e17026e45f5a2f044fab771ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Njw3zTJ09GjfjkNG57G1KLli68WNoHn8MYA2It4xPBiIcP3cIkbsR4lHVwFPL5WXSruoi5i+BWeLXusowUcIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:54:27.993628Z","bundle_sha256":"012db95006174310d68e2df751776ba11c5c386a670169b8cd9c14e26fc1ac85"}}