{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:SYXYSNYH4UN4ECHSEWJ2WRZ4GK","short_pith_number":"pith:SYXYSNYH","canonical_record":{"source":{"id":"0911.4351","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T10:16:58Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"ea012ce2ae6878f41dda0d55ca3b509c9b900943e6988181d27fe859f002cfb5","abstract_canon_sha256":"d897fb67fa8c0f4125514969d96a010e88bf7aa2dc607f10460f02da803aa701"},"schema_version":"1.0"},"canonical_sha256":"962f893707e51bc208f22593ab473c32a592446f0154d1086bf4d1023b133974","source":{"kind":"arxiv","id":"0911.4351","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4351","created_at":"2026-05-18T04:30:26Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4351v4","created_at":"2026-05-18T04:30:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4351","created_at":"2026-05-18T04:30:26Z"},{"alias_kind":"pith_short_12","alias_value":"SYXYSNYH4UN4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SYXYSNYH4UN4ECHS","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SYXYSNYH","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:SYXYSNYH4UN4ECHSEWJ2WRZ4GK","target":"record","payload":{"canonical_record":{"source":{"id":"0911.4351","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T10:16:58Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"ea012ce2ae6878f41dda0d55ca3b509c9b900943e6988181d27fe859f002cfb5","abstract_canon_sha256":"d897fb67fa8c0f4125514969d96a010e88bf7aa2dc607f10460f02da803aa701"},"schema_version":"1.0"},"canonical_sha256":"962f893707e51bc208f22593ab473c32a592446f0154d1086bf4d1023b133974","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:30:26.490509Z","signature_b64":"cWu3wZSpSimtFmrPtfCzkCM23CzYoi6Q8G1b1z7BP5iA85kLJ9jRqx3W25uCOiD2bvv7ix40EToHpRd4bSFEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962f893707e51bc208f22593ab473c32a592446f0154d1086bf4d1023b133974","last_reissued_at":"2026-05-18T04:30:26.490082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:30:26.490082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.4351","source_version":4,"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-18T04:30:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCuWY27h3v6lj/EweiXrauhNMFG2ZK0YuJzTLrWqd2CjH3LbGpfcyYABQhFJFZxy5of4AaZQ3Gu7CyAE0/hiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:33:56.206265Z"},"content_sha256":"ef9773f21991a2475309b146ae2b153a22d512a9423184ec1daf4b5006f1a864","schema_version":"1.0","event_id":"sha256:ef9773f21991a2475309b146ae2b153a22d512a9423184ec1daf4b5006f1a864"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:SYXYSNYH4UN4ECHSEWJ2WRZ4GK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local resilience and Hamiltonicity Maker-Breaker games in random-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Michael Krivelevich, Sonny Ben-Shimon","submitted_at":"2009-11-23T10:16:58Z","abstract_excerpt":"For an increasing monotone graph property $\\mP$ the \\emph{local resilience} of a graph $G$ with respect to $\\mP$ is the minimal $r$ for which there exists of a subgraph $H\\subseteq G$ with all degrees at most $r$ such that the removal of the edges of $H$ from $G$ creates a graph that does not possesses $\\mP$. This notion, which was implicitly studied for some ad-hoc properties, was recently treated in a more systematic way in a paper by Sudakov and Vu. Most research conducted with respect to this distance notion focused on the Binomial random graph model $\\GNP$ and some families of pseudo-rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4351","kind":"arxiv","version":4},"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-18T04:30:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6FlJLljvLsTeBAW4BsDZE6RKMims58woiJDVPkaTfdS9/EGXQohEgj3mwoOqrSzx27wV093WXKZyVNUN+qvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:33:56.206618Z"},"content_sha256":"d58882f4e8c45e266107206acfea481650b5dcf4d11f689e7b1b0e6decb6fbf2","schema_version":"1.0","event_id":"sha256:d58882f4e8c45e266107206acfea481650b5dcf4d11f689e7b1b0e6decb6fbf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/bundle.json","state_url":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/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-05-30T00:33:56Z","links":{"resolver":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK","bundle":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/bundle.json","state":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:SYXYSNYH4UN4ECHSEWJ2WRZ4GK","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":"d897fb67fa8c0f4125514969d96a010e88bf7aa2dc607f10460f02da803aa701","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T10:16:58Z","title_canon_sha256":"ea012ce2ae6878f41dda0d55ca3b509c9b900943e6988181d27fe859f002cfb5"},"schema_version":"1.0","source":{"id":"0911.4351","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.4351","created_at":"2026-05-18T04:30:26Z"},{"alias_kind":"arxiv_version","alias_value":"0911.4351v4","created_at":"2026-05-18T04:30:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4351","created_at":"2026-05-18T04:30:26Z"},{"alias_kind":"pith_short_12","alias_value":"SYXYSNYH4UN4","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"SYXYSNYH4UN4ECHS","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"SYXYSNYH","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:d58882f4e8c45e266107206acfea481650b5dcf4d11f689e7b1b0e6decb6fbf2","target":"graph","created_at":"2026-05-18T04:30:26Z","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":"For an increasing monotone graph property $\\mP$ the \\emph{local resilience} of a graph $G$ with respect to $\\mP$ is the minimal $r$ for which there exists of a subgraph $H\\subseteq G$ with all degrees at most $r$ such that the removal of the edges of $H$ from $G$ creates a graph that does not possesses $\\mP$. This notion, which was implicitly studied for some ad-hoc properties, was recently treated in a more systematic way in a paper by Sudakov and Vu. Most research conducted with respect to this distance notion focused on the Binomial random graph model $\\GNP$ and some families of pseudo-rand","authors_text":"Benny Sudakov, Michael Krivelevich, Sonny Ben-Shimon","cross_cats":["cs.DM","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T10:16:58Z","title":"Local resilience and Hamiltonicity Maker-Breaker games in random-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4351","kind":"arxiv","version":4},"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:ef9773f21991a2475309b146ae2b153a22d512a9423184ec1daf4b5006f1a864","target":"record","created_at":"2026-05-18T04:30:26Z","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":"d897fb67fa8c0f4125514969d96a010e88bf7aa2dc607f10460f02da803aa701","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-23T10:16:58Z","title_canon_sha256":"ea012ce2ae6878f41dda0d55ca3b509c9b900943e6988181d27fe859f002cfb5"},"schema_version":"1.0","source":{"id":"0911.4351","kind":"arxiv","version":4}},"canonical_sha256":"962f893707e51bc208f22593ab473c32a592446f0154d1086bf4d1023b133974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"962f893707e51bc208f22593ab473c32a592446f0154d1086bf4d1023b133974","first_computed_at":"2026-05-18T04:30:26.490082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:30:26.490082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cWu3wZSpSimtFmrPtfCzkCM23CzYoi6Q8G1b1z7BP5iA85kLJ9jRqx3W25uCOiD2bvv7ix40EToHpRd4bSFEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:30:26.490509Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.4351","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef9773f21991a2475309b146ae2b153a22d512a9423184ec1daf4b5006f1a864","sha256:d58882f4e8c45e266107206acfea481650b5dcf4d11f689e7b1b0e6decb6fbf2"],"state_sha256":"78dc47081bca23c3f3ad3a4e0b5cf4e06b1aedaf65b998315e119343ca274c96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jc/8hs/4SbekqOz462W1P+3F+PU/mPYYlAQN0vAsUTVQBq0Q7kpi34LCV7pdIRUI4QlYqUd2MqGBv1zQqE0kAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:33:56.208624Z","bundle_sha256":"8836c0ad12dd5b6a940b74ff959a0139d07414e66048f5f6eca19849f5cfb7a1"}}