{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DCTI4QKGHBMOMKEDHYS54NN6CO","short_pith_number":"pith:DCTI4QKG","schema_version":"1.0","canonical_sha256":"18a68e41463858e628833e25de35be139cee8e3bb5b25114e0edaa21268a5e30","source":{"kind":"arxiv","id":"1703.10380","version":1},"attestation_state":"computed","paper":{"title":"Finding Even Cycles Faster via Capped k-Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel, S{\\o}ren Dahlgaard","submitted_at":"2017-03-30T09:39:22Z","abstract_excerpt":"In this paper, we consider the problem of finding a cycle of length $2k$ (a $C_{2k}$) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k\\ge2$. A classic result by Bondy and Simonovits [J.Comb.Th.'74] implies that if $m \\ge100k n^{1+1/k}$, then $G$ contains a $C_{2k}$, further implying that one needs to consider only graphs with $m = O(n^{1+1/k})$.\n  Previously the best known algorithms were an $O(n^2)$ algorithm due to Yuster and Zwick [J.Disc.Math'97] as well as a $O(m^{2-(1+\\lceil k/2\\rceil^{-1})/(k+1)})$ algorithm by Alon et al. [Algorithmica'97].\n  We present an algori"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.10380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-30T09:39:22Z","cross_cats_sorted":[],"title_canon_sha256":"b3fd2244ae585a4d7b6dca468aca872e00c36a504c79e41eb5ec8e1408204e5a","abstract_canon_sha256":"edf28eeff4da18df4cc4e2fc7ec1593675690c8c5a95364c991f1180b0123f9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:37.172798Z","signature_b64":"RKyagKK40V2p+0n5sEdXRVTAc051cVSfmwcyqSKHg4epbOLwJwvO9umAcZpY5zkaVmu/7/L7DDMsLIwlAQ/1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a68e41463858e628833e25de35be139cee8e3bb5b25114e0edaa21268a5e30","last_reissued_at":"2026-05-18T00:47:37.172308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:37.172308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Even Cycles Faster via Capped k-Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel, S{\\o}ren Dahlgaard","submitted_at":"2017-03-30T09:39:22Z","abstract_excerpt":"In this paper, we consider the problem of finding a cycle of length $2k$ (a $C_{2k}$) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k\\ge2$. A classic result by Bondy and Simonovits [J.Comb.Th.'74] implies that if $m \\ge100k n^{1+1/k}$, then $G$ contains a $C_{2k}$, further implying that one needs to consider only graphs with $m = O(n^{1+1/k})$.\n  Previously the best known algorithms were an $O(n^2)$ algorithm due to Yuster and Zwick [J.Disc.Math'97] as well as a $O(m^{2-(1+\\lceil k/2\\rceil^{-1})/(k+1)})$ algorithm by Alon et al. [Algorithmica'97].\n  We present an algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10380","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.10380","created_at":"2026-05-18T00:47:37.172392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10380v1","created_at":"2026-05-18T00:47:37.172392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10380","created_at":"2026-05-18T00:47:37.172392+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCTI4QKGHBMO","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCTI4QKGHBMOMKED","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCTI4QKG","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO","json":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO.json","graph_json":"https://pith.science/api/pith-number/DCTI4QKGHBMOMKEDHYS54NN6CO/graph.json","events_json":"https://pith.science/api/pith-number/DCTI4QKGHBMOMKEDHYS54NN6CO/events.json","paper":"https://pith.science/paper/DCTI4QKG"},"agent_actions":{"view_html":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO","download_json":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO.json","view_paper":"https://pith.science/paper/DCTI4QKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10380&json=true","fetch_graph":"https://pith.science/api/pith-number/DCTI4QKGHBMOMKEDHYS54NN6CO/graph.json","fetch_events":"https://pith.science/api/pith-number/DCTI4QKGHBMOMKEDHYS54NN6CO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/action/storage_attestation","attest_author":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/action/author_attestation","sign_citation":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/action/citation_signature","submit_replication":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/action/replication_record"}},"created_at":"2026-05-18T00:47:37.172392+00:00","updated_at":"2026-05-18T00:47:37.172392+00:00"}