{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UGABTFC4FFKIN3REAJDKLXMSVV","short_pith_number":"pith:UGABTFC4","canonical_record":{"source":{"id":"1612.08802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T04:49:38Z","cross_cats_sorted":[],"title_canon_sha256":"f93e6a9c508a988b2c428e1798b3b84116c72079ec73b35922269bd4ca116efc","abstract_canon_sha256":"efcfe1efbf8a9a2f76c25f99a1db38db5620ced6be822850213c0ece928c4e6a"},"schema_version":"1.0"},"canonical_sha256":"a18019945c295486ee240246a5dd92ad7a64061d49d689f5bda78ccb89c29590","source":{"kind":"arxiv","id":"1612.08802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08802","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08802v2","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08802","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"UGABTFC4FFKI","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UGABTFC4FFKIN3RE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UGABTFC4","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UGABTFC4FFKIN3REAJDKLXMSVV","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T04:49:38Z","cross_cats_sorted":[],"title_canon_sha256":"f93e6a9c508a988b2c428e1798b3b84116c72079ec73b35922269bd4ca116efc","abstract_canon_sha256":"efcfe1efbf8a9a2f76c25f99a1db38db5620ced6be822850213c0ece928c4e6a"},"schema_version":"1.0"},"canonical_sha256":"a18019945c295486ee240246a5dd92ad7a64061d49d689f5bda78ccb89c29590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:56.025175Z","signature_b64":"Mx849p9W9pE4P1B8w10kIr5Y6jhttZY5xsQKjt6FUNw81RL8f7zS4Lmtm1Vyx95XrVLRq8qikrhlHDn+D1F5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a18019945c295486ee240246a5dd92ad7a64061d49d689f5bda78ccb89c29590","last_reissued_at":"2026-05-18T00:31:56.024675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:56.024675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08802","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:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqLYOJ6EdBKA4VOrp4fl/SDFg63Kcx5MlMZB+Ik6GH4XpJY8517gm3YO54MyD2Ozv43MIkvAkALx8gr8zhN/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:43.138266Z"},"content_sha256":"1ba484b4b960bf4afc71232243189ac38076f59f87cb5d2ab24be58d7bbdcf45","schema_version":"1.0","event_id":"sha256:1ba484b4b960bf4afc71232243189ac38076f59f87cb5d2ab24be58d7bbdcf45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UGABTFC4FFKIN3REAJDKLXMSVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pancyclicity when each cycle contains k chords","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vladislav Taranchuk","submitted_at":"2016-12-28T04:49:38Z","abstract_excerpt":"For integers $n \\geq k \\geq 2$, let $c(n,k)$ be the minimum number of chords that must be added to a cycle of length $n$ so that the resulting graph has the property that for every $l \\in \\{ k , k + 1 , \\dots , n \\}$, there is a cycle of length $l$ that contains exactly $k$ of the added chords. Affif Chaouche, Rutherford, and Whitty introduced the function $c(n,k)$. They showed that for every integer $k \\geq 2$, $c(n , k ) \\geq \\Omega_k ( n^{1/k} )$ and they asked if $n^{1/k}$ gives the correct order of magnitude of $c(n, k)$ for $k \\geq 2$. Our main theorem answers this question as we prove t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08802","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:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJ1X/tbdM6EdzmLR15EU8oFgO11eF6d94qCqEFhg1MjpuUxhdbT5oMWrHkDyX9u+ablt/VbRdPDpRGmsLnBTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:22:43.138922Z"},"content_sha256":"b8a3195674211238378b14777af6d8eb0cad41531ae3e82b5196f99d56453f64","schema_version":"1.0","event_id":"sha256:b8a3195674211238378b14777af6d8eb0cad41531ae3e82b5196f99d56453f64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGABTFC4FFKIN3REAJDKLXMSVV/bundle.json","state_url":"https://pith.science/pith/UGABTFC4FFKIN3REAJDKLXMSVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGABTFC4FFKIN3REAJDKLXMSVV/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-28T10:22:43Z","links":{"resolver":"https://pith.science/pith/UGABTFC4FFKIN3REAJDKLXMSVV","bundle":"https://pith.science/pith/UGABTFC4FFKIN3REAJDKLXMSVV/bundle.json","state":"https://pith.science/pith/UGABTFC4FFKIN3REAJDKLXMSVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGABTFC4FFKIN3REAJDKLXMSVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UGABTFC4FFKIN3REAJDKLXMSVV","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":"efcfe1efbf8a9a2f76c25f99a1db38db5620ced6be822850213c0ece928c4e6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T04:49:38Z","title_canon_sha256":"f93e6a9c508a988b2c428e1798b3b84116c72079ec73b35922269bd4ca116efc"},"schema_version":"1.0","source":{"id":"1612.08802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08802","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08802v2","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08802","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"UGABTFC4FFKI","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UGABTFC4FFKIN3RE","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UGABTFC4","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:b8a3195674211238378b14777af6d8eb0cad41531ae3e82b5196f99d56453f64","target":"graph","created_at":"2026-05-18T00:31:56Z","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":"For integers $n \\geq k \\geq 2$, let $c(n,k)$ be the minimum number of chords that must be added to a cycle of length $n$ so that the resulting graph has the property that for every $l \\in \\{ k , k + 1 , \\dots , n \\}$, there is a cycle of length $l$ that contains exactly $k$ of the added chords. Affif Chaouche, Rutherford, and Whitty introduced the function $c(n,k)$. They showed that for every integer $k \\geq 2$, $c(n , k ) \\geq \\Omega_k ( n^{1/k} )$ and they asked if $n^{1/k}$ gives the correct order of magnitude of $c(n, k)$ for $k \\geq 2$. Our main theorem answers this question as we prove t","authors_text":"Vladislav Taranchuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T04:49:38Z","title":"Pancyclicity when each cycle contains k chords"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08802","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:1ba484b4b960bf4afc71232243189ac38076f59f87cb5d2ab24be58d7bbdcf45","target":"record","created_at":"2026-05-18T00:31:56Z","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":"efcfe1efbf8a9a2f76c25f99a1db38db5620ced6be822850213c0ece928c4e6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-28T04:49:38Z","title_canon_sha256":"f93e6a9c508a988b2c428e1798b3b84116c72079ec73b35922269bd4ca116efc"},"schema_version":"1.0","source":{"id":"1612.08802","kind":"arxiv","version":2}},"canonical_sha256":"a18019945c295486ee240246a5dd92ad7a64061d49d689f5bda78ccb89c29590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a18019945c295486ee240246a5dd92ad7a64061d49d689f5bda78ccb89c29590","first_computed_at":"2026-05-18T00:31:56.024675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:56.024675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mx849p9W9pE4P1B8w10kIr5Y6jhttZY5xsQKjt6FUNw81RL8f7zS4Lmtm1Vyx95XrVLRq8qikrhlHDn+D1F5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:56.025175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ba484b4b960bf4afc71232243189ac38076f59f87cb5d2ab24be58d7bbdcf45","sha256:b8a3195674211238378b14777af6d8eb0cad41531ae3e82b5196f99d56453f64"],"state_sha256":"9442980ccd09c335e8458017081b8bbc50cee2d387798e293ecd6502f3984062"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CH4pcQ9TXbG99J59uQIscVFrRQUIh/bltKparbdWDEB4M3to3FmyEsj+j/vxMySniRsBV+bRfGobZHcCBJgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:22:43.142110Z","bundle_sha256":"25387c5f935ed8b63de7d3e8452033a266bc32948f456b8941fafc7a6020fef8"}}