{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZMM63QJEID5SF2E7WPNZ5MBVRO","short_pith_number":"pith:ZMM63QJE","canonical_record":{"source":{"id":"1104.4367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-21T23:53:22Z","cross_cats_sorted":[],"title_canon_sha256":"6b145906b3f52e90a2c661b917f817dc1df8a87c5822633c153a5ab9fc431f70","abstract_canon_sha256":"8e8112a14ac3d6911e8711141620e34ef596a68a8d06fec34386ab73bf98988e"},"schema_version":"1.0"},"canonical_sha256":"cb19edc12440fb22e89fb3db9eb0358b861f0e8d851d11041b8c57cec3f3d30e","source":{"kind":"arxiv","id":"1104.4367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4367","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4367v1","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4367","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZMM63QJEID5S","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZMM63QJEID5SF2E7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZMM63QJE","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZMM63QJEID5SF2E7WPNZ5MBVRO","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-21T23:53:22Z","cross_cats_sorted":[],"title_canon_sha256":"6b145906b3f52e90a2c661b917f817dc1df8a87c5822633c153a5ab9fc431f70","abstract_canon_sha256":"8e8112a14ac3d6911e8711141620e34ef596a68a8d06fec34386ab73bf98988e"},"schema_version":"1.0"},"canonical_sha256":"cb19edc12440fb22e89fb3db9eb0358b861f0e8d851d11041b8c57cec3f3d30e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:34.778938Z","signature_b64":"E/RUv46dI+RQ1m7WJQg0QWsVQbLXxduSGl6vKS50tm0h452yZeSVBQ3qcQxFSQda7nZtcUKOyCGYqreoFbluCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb19edc12440fb22e89fb3db9eb0358b861f0e8d851d11041b8c57cec3f3d30e","last_reissued_at":"2026-05-18T04:23:34.778079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:34.778079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4367","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-18T04:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82h5dqSAKN8YAwqO5GjZHxWXpxG0Hi/aNALyxUz2o64c64hEKr4NK9V6ldxxBeC6Ni0G+o0Is2y6+6ZhBoumCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:35:19.566881Z"},"content_sha256":"b9cf400f2ed749f69ce7d3e463b87cd60f2d68c384c790520e6a7d74a1205352","schema_version":"1.0","event_id":"sha256:b9cf400f2ed749f69ce7d3e463b87cd60f2d68c384c790520e6a7d74a1205352"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZMM63QJEID5SF2E7WPNZ5MBVRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"P\\'osa's Conjecture for graphs of order at least 2\\times 10^8","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"H.A. Kierstead, Louis DeBiasio, Phong Ch\\^au","submitted_at":"2011-04-21T23:53:22Z","abstract_excerpt":"In 1962 P\\'osa conjectured that every graph G on n vertices with minimum degree at least 2n/3 contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path version of P\\'osa's Conjecture. They also proved that it would suffice to show that G contains the square of a cycle of length greater than 2n/3. Still in 1996, Koml\\'os, S\\'ark\\\"ozy, and Szemer\\'edi proved P\\'osa's Conjecture, using the Regularity and Blow-up Lemmas, for graphs of order n > n_0, where n_0 is a very large constant. Here we show without using these lemmas that n_0=2\\times 10^8 is sufficient. We are mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4367","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-18T04:23:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfNDK8h5D/UjZHFFL6Rb/IUXdz5NKnWgb8zd1/bnhoFYTSwsWfWFzaoGU01Wy66q0GFWVmPniXNMcPsRhQ0ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:35:19.567220Z"},"content_sha256":"368aaceffb87637c1db67a0428036eba88ae92a8774e708feddbb331e88c775f","schema_version":"1.0","event_id":"sha256:368aaceffb87637c1db67a0428036eba88ae92a8774e708feddbb331e88c775f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO/bundle.json","state_url":"https://pith.science/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO/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-25T22:35:19Z","links":{"resolver":"https://pith.science/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO","bundle":"https://pith.science/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO/bundle.json","state":"https://pith.science/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMM63QJEID5SF2E7WPNZ5MBVRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZMM63QJEID5SF2E7WPNZ5MBVRO","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":"8e8112a14ac3d6911e8711141620e34ef596a68a8d06fec34386ab73bf98988e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-21T23:53:22Z","title_canon_sha256":"6b145906b3f52e90a2c661b917f817dc1df8a87c5822633c153a5ab9fc431f70"},"schema_version":"1.0","source":{"id":"1104.4367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4367","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4367v1","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4367","created_at":"2026-05-18T04:23:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZMM63QJEID5S","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZMM63QJEID5SF2E7","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZMM63QJE","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:368aaceffb87637c1db67a0428036eba88ae92a8774e708feddbb331e88c775f","target":"graph","created_at":"2026-05-18T04:23:34Z","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 every graph G on n vertices with minimum degree at least 2n/3 contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path version of P\\'osa's Conjecture. They also proved that it would suffice to show that G contains the square of a cycle of length greater than 2n/3. Still in 1996, Koml\\'os, S\\'ark\\\"ozy, and Szemer\\'edi proved P\\'osa's Conjecture, using the Regularity and Blow-up Lemmas, for graphs of order n > n_0, where n_0 is a very large constant. Here we show without using these lemmas that n_0=2\\times 10^8 is sufficient. We are mo","authors_text":"H.A. Kierstead, Louis DeBiasio, Phong Ch\\^au","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-21T23:53:22Z","title":"P\\'osa's Conjecture for graphs of order at least 2\\times 10^8"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4367","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:b9cf400f2ed749f69ce7d3e463b87cd60f2d68c384c790520e6a7d74a1205352","target":"record","created_at":"2026-05-18T04:23:34Z","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":"8e8112a14ac3d6911e8711141620e34ef596a68a8d06fec34386ab73bf98988e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-21T23:53:22Z","title_canon_sha256":"6b145906b3f52e90a2c661b917f817dc1df8a87c5822633c153a5ab9fc431f70"},"schema_version":"1.0","source":{"id":"1104.4367","kind":"arxiv","version":1}},"canonical_sha256":"cb19edc12440fb22e89fb3db9eb0358b861f0e8d851d11041b8c57cec3f3d30e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb19edc12440fb22e89fb3db9eb0358b861f0e8d851d11041b8c57cec3f3d30e","first_computed_at":"2026-05-18T04:23:34.778079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:34.778079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E/RUv46dI+RQ1m7WJQg0QWsVQbLXxduSGl6vKS50tm0h452yZeSVBQ3qcQxFSQda7nZtcUKOyCGYqreoFbluCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:34.778938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9cf400f2ed749f69ce7d3e463b87cd60f2d68c384c790520e6a7d74a1205352","sha256:368aaceffb87637c1db67a0428036eba88ae92a8774e708feddbb331e88c775f"],"state_sha256":"f9089b0d38449e9704efec4c7694b2d4c8e4a17422d842d25be49d2fc2d1ae9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyzVshx8HpPqdpPRJRibRTz8MA61WQXZuwc1gtOYJBH2Fy+GylerIP5PMe3UlNWdFLvYtfVS3vtXvPUCGOXJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:35:19.569157Z","bundle_sha256":"82ff6d9481186cb0898178cc385be1e0c26b6a2a23aba546468c647ff9281f0a"}}