{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7VVYWDRNRBNVHVNNKKD4SDU3TQ","short_pith_number":"pith:7VVYWDRN","schema_version":"1.0","canonical_sha256":"fd6b8b0e2d885b53d5ad5287c90e9b9c0be37522cab27326fd7213d6b514c83d","source":{"kind":"arxiv","id":"1311.0358","version":2},"attestation_state":"computed","paper":{"title":"A Faster Algorithm to Recognize Even-Hole-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsien-Chih Chang, Hsueh-I Lu","submitted_at":"2013-11-02T09:03:10Z","abstract_excerpt":"We study the problem of determining whether an $n$-node graph $G$ has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, Cornu\\'ejols, Kapoor, and Vu\\v{s}kovi\\'c gave the first polynomial-time algorithm for the problem, which runs in $O(n^{40})$ time. Later, Chudnovsky, Kawarabayashi, and Seymour reduced the running time to $O(n^{31})$. The best previously known algorithm for the problem, due to da Silva and Vu\\v{s}kovi\\'c, runs in $O(n^{19})$ time. In this paper, we solve the problem in $O(n^{11})$ time. Moreover, if $G$ has even holes, our algorithm "},"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":"1311.0358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:03:10Z","cross_cats_sorted":[],"title_canon_sha256":"62025b0ffd801a15875aee6bc8f8f29b6b7a9e1a4eee4004276883078a26ca79","abstract_canon_sha256":"cc0a37b359a441a5af805e02b227c14f94f1ff8e365ab37a8a3c38cc76b59d05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:18.990889Z","signature_b64":"6vJp877Lvb6lI8+SJfVhn8WJ3m9TykcXA6K3rgpKMyuUDhREFgH/M2ILayALs8cv1woAdFXMiz7W5ZMz0yWKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd6b8b0e2d885b53d5ad5287c90e9b9c0be37522cab27326fd7213d6b514c83d","last_reissued_at":"2026-05-18T02:27:18.990237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:18.990237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Algorithm to Recognize Even-Hole-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsien-Chih Chang, Hsueh-I Lu","submitted_at":"2013-11-02T09:03:10Z","abstract_excerpt":"We study the problem of determining whether an $n$-node graph $G$ has an even hole, i.e., an induced simple cycle consisting of an even number of nodes. Conforti, Cornu\\'ejols, Kapoor, and Vu\\v{s}kovi\\'c gave the first polynomial-time algorithm for the problem, which runs in $O(n^{40})$ time. Later, Chudnovsky, Kawarabayashi, and Seymour reduced the running time to $O(n^{31})$. The best previously known algorithm for the problem, due to da Silva and Vu\\v{s}kovi\\'c, runs in $O(n^{19})$ time. In this paper, we solve the problem in $O(n^{11})$ time. Moreover, if $G$ has even holes, our algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0358","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.0358","created_at":"2026-05-18T02:27:18.990338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.0358v2","created_at":"2026-05-18T02:27:18.990338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0358","created_at":"2026-05-18T02:27:18.990338+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VVYWDRNRBNV","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VVYWDRNRBNVHVNN","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VVYWDRN","created_at":"2026-05-18T12:27:38.830355+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/7VVYWDRNRBNVHVNNKKD4SDU3TQ","json":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ.json","graph_json":"https://pith.science/api/pith-number/7VVYWDRNRBNVHVNNKKD4SDU3TQ/graph.json","events_json":"https://pith.science/api/pith-number/7VVYWDRNRBNVHVNNKKD4SDU3TQ/events.json","paper":"https://pith.science/paper/7VVYWDRN"},"agent_actions":{"view_html":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ","download_json":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ.json","view_paper":"https://pith.science/paper/7VVYWDRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.0358&json=true","fetch_graph":"https://pith.science/api/pith-number/7VVYWDRNRBNVHVNNKKD4SDU3TQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7VVYWDRNRBNVHVNNKKD4SDU3TQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/action/storage_attestation","attest_author":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/action/author_attestation","sign_citation":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/action/citation_signature","submit_replication":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/action/replication_record"}},"created_at":"2026-05-18T02:27:18.990338+00:00","updated_at":"2026-05-18T02:27:18.990338+00:00"}