{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AEWG2HX7EZ6HDQHTMTACCW3WKW","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":"d130b5078ccecb7ece190049655cf1643605be30929b999ce3a319274e794166","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-16T23:10:17Z","title_canon_sha256":"dd96a59de3f9fd3440618b934bd3d5d3ebcf64d21eb1df2b8bdfb205aeaada7d"},"schema_version":"1.0","source":{"id":"1101.3099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3099","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3099v1","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3099","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"AEWG2HX7EZ6H","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AEWG2HX7EZ6HDQHT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AEWG2HX7","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a24296183565a22a5939a275d83ef5e4f39410257f97bbf174d5878488a5195e","target":"graph","created_at":"2026-05-18T03:03:21Z","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":"Let $\\bk=(k_1,...,k_n)$ be a sequence of $n$ integers. For an increasing monotone graph property $\\mP$ we say that a base graph $G=([n],E)$ is \\emph{$\\bk$-resilient} with respect to $\\mP$ if for every subgraph $H\\subseteq G$ such that $d_H(i)\\leq k_i$ for every $1\\leq i\\leq n$ the graph $G-H$ possesses $\\mP$. This notion naturally extends the idea of the \\emph{local resilience} of graphs recently initiated by Sudakov and Vu. In this paper we study the $\\bk$-resilience of a typical graph from $\\GNP$ with respect to the Hamiltonicity property where we let $p$ range over all values for which the ","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":"2011-01-16T23:10:17Z","title":"On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3099","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:8da28b7a1e37717a70de74ba1b931ea660cb4cefc54d3e7ffcd8ed8f7e4aefd0","target":"record","created_at":"2026-05-18T03:03:21Z","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":"d130b5078ccecb7ece190049655cf1643605be30929b999ce3a319274e794166","cross_cats_sorted":["cs.DM","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-16T23:10:17Z","title_canon_sha256":"dd96a59de3f9fd3440618b934bd3d5d3ebcf64d21eb1df2b8bdfb205aeaada7d"},"schema_version":"1.0","source":{"id":"1101.3099","kind":"arxiv","version":1}},"canonical_sha256":"012c6d1eff267c71c0f364c0215b7655a8ac0f7fd22367faa96534b6cc953db7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"012c6d1eff267c71c0f364c0215b7655a8ac0f7fd22367faa96534b6cc953db7","first_computed_at":"2026-05-18T03:03:21.588961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:21.588961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cg97Slu2HOF21bdOUdAAD4QJ3wlkJ6yvvMPP4XBamkn+hu84AnMV0FhcaOJ6Q3yBPmh4SrCu9Nvhn3TgXqgCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:21.589456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8da28b7a1e37717a70de74ba1b931ea660cb4cefc54d3e7ffcd8ed8f7e4aefd0","sha256:a24296183565a22a5939a275d83ef5e4f39410257f97bbf174d5878488a5195e"],"state_sha256":"f585aef77003afd8ebdff26c8f103ce5102a8d4f5a4a0103a1eb6884c1737877"}