{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TMIHM6UWZVFNKMA4UB44VCTJKO","short_pith_number":"pith:TMIHM6UW","canonical_record":{"source":{"id":"1709.03901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T15:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"be93eca95404d1b290d86fb42554a7e29b2feae7de23ae817b5adfd9a49b5641","abstract_canon_sha256":"44fe77cf12c60fa7e8652e735bdf198e8cbc788ceba2100dbc0081afc9b3523a"},"schema_version":"1.0"},"canonical_sha256":"9b10767a96cd4ad5301ca079ca8a6953b4602c6972bca5856b43d8d17e4fab3a","source":{"kind":"arxiv","id":"1709.03901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03901","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03901v2","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03901","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"TMIHM6UWZVFN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TMIHM6UWZVFNKMA4","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TMIHM6UW","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TMIHM6UWZVFNKMA4UB44VCTJKO","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T15:12:22Z","cross_cats_sorted":[],"title_canon_sha256":"be93eca95404d1b290d86fb42554a7e29b2feae7de23ae817b5adfd9a49b5641","abstract_canon_sha256":"44fe77cf12c60fa7e8652e735bdf198e8cbc788ceba2100dbc0081afc9b3523a"},"schema_version":"1.0"},"canonical_sha256":"9b10767a96cd4ad5301ca079ca8a6953b4602c6972bca5856b43d8d17e4fab3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:51.134953Z","signature_b64":"Lsqr5MSIezCQ8fXyGzdZIJOeTJ1Sn2d5AuHJv/2RSGHwGru9Ff8JEIBonPRzuTWIMqkcNHcPNyhhtvTTFpa8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b10767a96cd4ad5301ca079ca8a6953b4602c6972bca5856b43d8d17e4fab3a","last_reissued_at":"2026-05-18T00:06:51.134367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:51.134367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03901","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-18T00:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFZqkC05KGL3h2wsLPmTJ+kXX98851SkCspntLSI++I0/Ml056pUS689L8+802oUVipBD9tcVlLVOLVoUOl8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:09:49.417479Z"},"content_sha256":"6d12bb2556d61780c9bf7475bfa86b54503240abc9ae4fef733fc8e7641b40e7","schema_version":"1.0","event_id":"sha256:6d12bb2556d61780c9bf7475bfa86b54503240abc9ae4fef733fc8e7641b40e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TMIHM6UWZVFNKMA4UB44VCTJKO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local resilience of an almost spanning $k$-cycle in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger, Milo\\v{s} Truji\\'c, Nemanja \\v{S}kori\\'c","submitted_at":"2017-09-12T15:12:22Z","abstract_excerpt":"The famous P\\'{o}sa-Seymour conjecture, confirmed in 1998 by Koml\\'{o}s, S\\'{a}rk\\\"{o}zy, and Szemer\\'{e}di, states that for any $k \\geq 2$, every graph on $n$ vertices with minimum degree $kn/(k + 1)$ contains the $k$-th power of a Hamilton cycle. We extend this result to a sparse random setting.\n  We show that for every $k \\geq 2$ there exists $C > 0$ such that if $p \\geq C(\\log n/n)^{1/k}$ then w.h.p. every subgraph of a random graph $G_{n, p}$ with minimum degree at least $(k/(k + 1) + o(1))np$, contains the $k$-th power of a cycle on at least $(1 - o(1))n$ vertices, improving upon the rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03901","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-18T00:06:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Motthgtm+BShvkzqIRzP1oRqkJQyw4lt/pZSL8PTpk4kNoz8v7dk+UrgqgTkZtFo2+C4dnAF6TOPmnwkTLEIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:09:49.417836Z"},"content_sha256":"39c3f6e5f425f7d6b17d9f0397de062c1474a962108805954dbee81ab9f2a8d5","schema_version":"1.0","event_id":"sha256:39c3f6e5f425f7d6b17d9f0397de062c1474a962108805954dbee81ab9f2a8d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMIHM6UWZVFNKMA4UB44VCTJKO/bundle.json","state_url":"https://pith.science/pith/TMIHM6UWZVFNKMA4UB44VCTJKO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMIHM6UWZVFNKMA4UB44VCTJKO/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-02T23:09:49Z","links":{"resolver":"https://pith.science/pith/TMIHM6UWZVFNKMA4UB44VCTJKO","bundle":"https://pith.science/pith/TMIHM6UWZVFNKMA4UB44VCTJKO/bundle.json","state":"https://pith.science/pith/TMIHM6UWZVFNKMA4UB44VCTJKO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMIHM6UWZVFNKMA4UB44VCTJKO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TMIHM6UWZVFNKMA4UB44VCTJKO","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":"44fe77cf12c60fa7e8652e735bdf198e8cbc788ceba2100dbc0081afc9b3523a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T15:12:22Z","title_canon_sha256":"be93eca95404d1b290d86fb42554a7e29b2feae7de23ae817b5adfd9a49b5641"},"schema_version":"1.0","source":{"id":"1709.03901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03901","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03901v2","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03901","created_at":"2026-05-18T00:06:51Z"},{"alias_kind":"pith_short_12","alias_value":"TMIHM6UWZVFN","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TMIHM6UWZVFNKMA4","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TMIHM6UW","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:39c3f6e5f425f7d6b17d9f0397de062c1474a962108805954dbee81ab9f2a8d5","target":"graph","created_at":"2026-05-18T00:06:51Z","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":"The famous P\\'{o}sa-Seymour conjecture, confirmed in 1998 by Koml\\'{o}s, S\\'{a}rk\\\"{o}zy, and Szemer\\'{e}di, states that for any $k \\geq 2$, every graph on $n$ vertices with minimum degree $kn/(k + 1)$ contains the $k$-th power of a Hamilton cycle. We extend this result to a sparse random setting.\n  We show that for every $k \\geq 2$ there exists $C > 0$ such that if $p \\geq C(\\log n/n)^{1/k}$ then w.h.p. every subgraph of a random graph $G_{n, p}$ with minimum degree at least $(k/(k + 1) + o(1))np$, contains the $k$-th power of a cycle on at least $(1 - o(1))n$ vertices, improving upon the rec","authors_text":"Angelika Steger, Milo\\v{s} Truji\\'c, Nemanja \\v{S}kori\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T15:12:22Z","title":"Local resilience of an almost spanning $k$-cycle in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03901","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:6d12bb2556d61780c9bf7475bfa86b54503240abc9ae4fef733fc8e7641b40e7","target":"record","created_at":"2026-05-18T00:06:51Z","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":"44fe77cf12c60fa7e8652e735bdf198e8cbc788ceba2100dbc0081afc9b3523a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T15:12:22Z","title_canon_sha256":"be93eca95404d1b290d86fb42554a7e29b2feae7de23ae817b5adfd9a49b5641"},"schema_version":"1.0","source":{"id":"1709.03901","kind":"arxiv","version":2}},"canonical_sha256":"9b10767a96cd4ad5301ca079ca8a6953b4602c6972bca5856b43d8d17e4fab3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b10767a96cd4ad5301ca079ca8a6953b4602c6972bca5856b43d8d17e4fab3a","first_computed_at":"2026-05-18T00:06:51.134367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:51.134367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lsqr5MSIezCQ8fXyGzdZIJOeTJ1Sn2d5AuHJv/2RSGHwGru9Ff8JEIBonPRzuTWIMqkcNHcPNyhhtvTTFpa8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:51.134953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d12bb2556d61780c9bf7475bfa86b54503240abc9ae4fef733fc8e7641b40e7","sha256:39c3f6e5f425f7d6b17d9f0397de062c1474a962108805954dbee81ab9f2a8d5"],"state_sha256":"c3773d5b93e9e21dc0cd1133db5ada8cf88a862906ad9dce7dc6cd5f48d322f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ddN+mCCZjzzrwVJhjwiil2eXSJ/p/lFxuBv5T9JfTEFDJIDTP9ywMmcnwStKJcyv64OF6wkjX8Rg8lR21oX+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:09:49.419912Z","bundle_sha256":"c507402a739e90ddb1c3b2aefe2940ab805b7beafcefe002ae351f060ac1478e"}}