{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:SYXYSNYH4UN4ECHSEWJ2WRZ4GK","short_pith_number":"pith:SYXYSNYH","schema_version":"1.0","canonical_sha256":"962f893707e51bc208f22593ab473c32a592446f0154d1086bf4d1023b133974","source":{"kind":"arxiv","id":"0911.4351","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0911.4351","created_at":"2026-05-18T04:30:26.490139+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.4351v4","created_at":"2026-05-18T04:30:26.490139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.4351","created_at":"2026-05-18T04:30:26.490139+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYXYSNYH4UN4","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYXYSNYH4UN4ECHS","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYXYSNYH","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK","json":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK.json","graph_json":"https://pith.science/api/pith-number/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/graph.json","events_json":"https://pith.science/api/pith-number/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/events.json","paper":"https://pith.science/paper/SYXYSNYH"},"agent_actions":{"view_html":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK","download_json":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK.json","view_paper":"https://pith.science/paper/SYXYSNYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.4351&json=true","fetch_graph":"https://pith.science/api/pith-number/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/graph.json","fetch_events":"https://pith.science/api/pith-number/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/action/storage_attestation","attest_author":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/action/author_attestation","sign_citation":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/action/citation_signature","submit_replication":"https://pith.science/pith/SYXYSNYH4UN4ECHSEWJ2WRZ4GK/action/replication_record"}},"created_at":"2026-05-18T04:30:26.490139+00:00","updated_at":"2026-05-18T04:30:26.490139+00:00"}