{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RNW6Q6QG5GOC7BUY6B3J6GKGP5","short_pith_number":"pith:RNW6Q6QG","canonical_record":{"source":{"id":"1606.02958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T13:24:31Z","cross_cats_sorted":[],"title_canon_sha256":"8fc5383acd1953162bb20276987b72a19fb18fc8b3d885102ba51c4da7cd49ef","abstract_canon_sha256":"1e4cd702408a299726dcd978d8d60a40bf75b96640b5f62bc647f22c83340b39"},"schema_version":"1.0"},"canonical_sha256":"8b6de87a06e99c2f8698f0769f19467f7e6fffbbc046dc17816acef1c38d85cd","source":{"kind":"arxiv","id":"1606.02958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02958","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02958v1","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02958","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"RNW6Q6QG5GOC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNW6Q6QG5GOC7BUY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNW6Q6QG","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RNW6Q6QG5GOC7BUY6B3J6GKGP5","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T13:24:31Z","cross_cats_sorted":[],"title_canon_sha256":"8fc5383acd1953162bb20276987b72a19fb18fc8b3d885102ba51c4da7cd49ef","abstract_canon_sha256":"1e4cd702408a299726dcd978d8d60a40bf75b96640b5f62bc647f22c83340b39"},"schema_version":"1.0"},"canonical_sha256":"8b6de87a06e99c2f8698f0769f19467f7e6fffbbc046dc17816acef1c38d85cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:38.539091Z","signature_b64":"eLY1ekraW00J1ptFT2pgQ7n/ukBuE960bRUwXAt1omce82K7IGY1Q9ytcpKDD8yhFOc/ZO0uQTc5rDSR/Kw0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b6de87a06e99c2f8698f0769f19467f7e6fffbbc046dc17816acef1c38d85cd","last_reissued_at":"2026-05-18T01:12:38.538664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:38.538664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02958","source_version":1,"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-18T01:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VybeF5cQDIiQRJf/OoxLK7uL2Wyjf26+b0FUoGHp0f5xx1aasMYzMkmJ9wqZfOD8zLaUqzNWwiwjVpsj3B0TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:37:12.161535Z"},"content_sha256":"78d86364e5b642b8ea82ca1fdfa55dfd6916394ecf106a0cb40ba8609e2b8ed6","schema_version":"1.0","event_id":"sha256:78d86364e5b642b8ea82ca1fdfa55dfd6916394ecf106a0cb40ba8609e2b8ed6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RNW6Q6QG5GOC7BUY6B3J6GKGP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local resilience for squares of almost spanning cycles in sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andreas Noever, Angelika Steger","submitted_at":"2016-06-09T13:24:31Z","abstract_excerpt":"In 1962, P\\'osa conjectured that a graph $G=(V, E)$ contains a square of a Hamiltonian cycle if $\\delta(G)\\ge 2n/3$. Only more than thirty years later Koml\\'os, S\\'ark\\H{o}zy, and Szemer\\'edi proved this conjecture using the so-called Blow-Up Lemma. Here we extend their result to a random graph setting. We show that for every $\\epsilon > 0$ and $p=n^{-1/2+\\epsilon}$ a.a.s. every subgraph of $G_{n,p}$ with minimum degree at least $(2/3+\\epsilon)np$ contains the square of a cycle on $(1-o(1))n$ vertices. This is almost best possible in three ways: (1) for $p\\ll n^{-1/2}$ the random graph will no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02958","kind":"arxiv","version":1},"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-18T01:12:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auALo3oixUKaITSmwBWyP79qBEsEchrT9KldsSBxhF4ntlptiD6cz5fBcyN3YjP2XZogwyfH6IqBG0EPdI9uDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:37:12.162175Z"},"content_sha256":"6322bdda03676877aebc953a3f910ce300a24118166ba425979485ce3e578af8","schema_version":"1.0","event_id":"sha256:6322bdda03676877aebc953a3f910ce300a24118166ba425979485ce3e578af8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5/bundle.json","state_url":"https://pith.science/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5/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-31T11:37:12Z","links":{"resolver":"https://pith.science/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5","bundle":"https://pith.science/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5/bundle.json","state":"https://pith.science/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNW6Q6QG5GOC7BUY6B3J6GKGP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RNW6Q6QG5GOC7BUY6B3J6GKGP5","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":"1e4cd702408a299726dcd978d8d60a40bf75b96640b5f62bc647f22c83340b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T13:24:31Z","title_canon_sha256":"8fc5383acd1953162bb20276987b72a19fb18fc8b3d885102ba51c4da7cd49ef"},"schema_version":"1.0","source":{"id":"1606.02958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02958","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02958v1","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02958","created_at":"2026-05-18T01:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"RNW6Q6QG5GOC","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNW6Q6QG5GOC7BUY","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNW6Q6QG","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:6322bdda03676877aebc953a3f910ce300a24118166ba425979485ce3e578af8","target":"graph","created_at":"2026-05-18T01:12:38Z","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 1962, P\\'osa conjectured that a graph $G=(V, E)$ contains a square of a Hamiltonian cycle if $\\delta(G)\\ge 2n/3$. Only more than thirty years later Koml\\'os, S\\'ark\\H{o}zy, and Szemer\\'edi proved this conjecture using the so-called Blow-Up Lemma. Here we extend their result to a random graph setting. We show that for every $\\epsilon > 0$ and $p=n^{-1/2+\\epsilon}$ a.a.s. every subgraph of $G_{n,p}$ with minimum degree at least $(2/3+\\epsilon)np$ contains the square of a cycle on $(1-o(1))n$ vertices. This is almost best possible in three ways: (1) for $p\\ll n^{-1/2}$ the random graph will no","authors_text":"Andreas Noever, Angelika Steger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T13:24:31Z","title":"Local resilience for squares of almost spanning cycles in sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02958","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:78d86364e5b642b8ea82ca1fdfa55dfd6916394ecf106a0cb40ba8609e2b8ed6","target":"record","created_at":"2026-05-18T01:12:38Z","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":"1e4cd702408a299726dcd978d8d60a40bf75b96640b5f62bc647f22c83340b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T13:24:31Z","title_canon_sha256":"8fc5383acd1953162bb20276987b72a19fb18fc8b3d885102ba51c4da7cd49ef"},"schema_version":"1.0","source":{"id":"1606.02958","kind":"arxiv","version":1}},"canonical_sha256":"8b6de87a06e99c2f8698f0769f19467f7e6fffbbc046dc17816acef1c38d85cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b6de87a06e99c2f8698f0769f19467f7e6fffbbc046dc17816acef1c38d85cd","first_computed_at":"2026-05-18T01:12:38.538664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:38.538664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eLY1ekraW00J1ptFT2pgQ7n/ukBuE960bRUwXAt1omce82K7IGY1Q9ytcpKDD8yhFOc/ZO0uQTc5rDSR/Kw0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:38.539091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78d86364e5b642b8ea82ca1fdfa55dfd6916394ecf106a0cb40ba8609e2b8ed6","sha256:6322bdda03676877aebc953a3f910ce300a24118166ba425979485ce3e578af8"],"state_sha256":"a2e63a3487e97af4a51788bf170445ae1f4e022e6901e37e249a481245738eb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PkgfKZCyclxyceaGH6QfsuinSHk3YvAfG2dm9kk9PJgElrYyqMkWnFwDH8Cad0Y4+zrhggW3oz/fFslTUeHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:37:12.164798Z","bundle_sha256":"1771e73080e359040147ee852a5907a80bfdbbb016391273388b1ef023f3e55d"}}