{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DCTI4QKGHBMOMKEDHYS54NN6CO","short_pith_number":"pith:DCTI4QKG","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"},"canonical_sha256":"18a68e41463858e628833e25de35be139cee8e3bb5b25114e0edaa21268a5e30","source":{"kind":"arxiv","id":"1703.10380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10380","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10380v1","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10380","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"DCTI4QKGHBMO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DCTI4QKGHBMOMKED","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DCTI4QKG","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DCTI4QKGHBMOMKEDHYS54NN6CO","target":"record","payload":{"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"},"canonical_sha256":"18a68e41463858e628833e25de35be139cee8e3bb5b25114e0edaa21268a5e30","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"},"source_kind":"arxiv","source_id":"1703.10380","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-18T00:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJD6caJrkOv1usl4xNSV/J4QBp0CD33xWf7NSFZvAFN7wJy1tkpsXx5o+3MaWIs3XjAwoyHerLoAbAwU19NKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T17:17:11.685496Z"},"content_sha256":"f0bff2a65d9dcf5ab4e7920c2182a3a6d6b8a3004e50fdf306e99eb8a2808ba4","schema_version":"1.0","event_id":"sha256:f0bff2a65d9dcf5ab4e7920c2182a3a6d6b8a3004e50fdf306e99eb8a2808ba4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DCTI4QKGHBMOMKEDHYS54NN6CO","target":"graph","payload":{"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"},"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:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/jse5ciXI7xr2rbiwqW0WXqj1ZPMGbt0FuBuAlsCkHACMzpzT7tK98dEDX+4rgzg5hYHFxXNAno69tNJ5ku1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T17:17:11.686223Z"},"content_sha256":"4f6a978ab66c28856e053d25a1d8398facd9c7ec1221969444e3cb56fcce38c3","schema_version":"1.0","event_id":"sha256:4f6a978ab66c28856e053d25a1d8398facd9c7ec1221969444e3cb56fcce38c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/bundle.json","state_url":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/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-10T17:17:11Z","links":{"resolver":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO","bundle":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/bundle.json","state":"https://pith.science/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCTI4QKGHBMOMKEDHYS54NN6CO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DCTI4QKGHBMOMKEDHYS54NN6CO","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":"edf28eeff4da18df4cc4e2fc7ec1593675690c8c5a95364c991f1180b0123f9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-30T09:39:22Z","title_canon_sha256":"b3fd2244ae585a4d7b6dca468aca872e00c36a504c79e41eb5ec8e1408204e5a"},"schema_version":"1.0","source":{"id":"1703.10380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10380","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10380v1","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10380","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"DCTI4QKGHBMO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DCTI4QKGHBMOMKED","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DCTI4QKG","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:4f6a978ab66c28856e053d25a1d8398facd9c7ec1221969444e3cb56fcce38c3","target":"graph","created_at":"2026-05-18T00:47:37Z","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 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","authors_text":"Mathias B{\\ae}k Tejs Knudsen, Morten St\\\"ockel, S{\\o}ren Dahlgaard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-30T09:39:22Z","title":"Finding Even Cycles Faster via Capped k-Walks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10380","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:f0bff2a65d9dcf5ab4e7920c2182a3a6d6b8a3004e50fdf306e99eb8a2808ba4","target":"record","created_at":"2026-05-18T00:47:37Z","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":"edf28eeff4da18df4cc4e2fc7ec1593675690c8c5a95364c991f1180b0123f9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-30T09:39:22Z","title_canon_sha256":"b3fd2244ae585a4d7b6dca468aca872e00c36a504c79e41eb5ec8e1408204e5a"},"schema_version":"1.0","source":{"id":"1703.10380","kind":"arxiv","version":1}},"canonical_sha256":"18a68e41463858e628833e25de35be139cee8e3bb5b25114e0edaa21268a5e30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18a68e41463858e628833e25de35be139cee8e3bb5b25114e0edaa21268a5e30","first_computed_at":"2026-05-18T00:47:37.172308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:37.172308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RKyagKK40V2p+0n5sEdXRVTAc051cVSfmwcyqSKHg4epbOLwJwvO9umAcZpY5zkaVmu/7/L7DDMsLIwlAQ/1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:37.172798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0bff2a65d9dcf5ab4e7920c2182a3a6d6b8a3004e50fdf306e99eb8a2808ba4","sha256:4f6a978ab66c28856e053d25a1d8398facd9c7ec1221969444e3cb56fcce38c3"],"state_sha256":"94ece025899729f126f7d6a9551b9d1880b9ed9d7e1303a3461501425eff99a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/CJN31BJS/3VG0O7F0m9HvcnlVcDbdV+79PrpyDB7IRLNH/KH7OXBylU3ZoY3yRMnKLbWLMHkz1WhCjAopJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T17:17:11.692353Z","bundle_sha256":"071729f0201a3ea42f970078554b473861651d71b7c8da39d74798f5e0e6eec9"}}