{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7VVYWDRNRBNVHVNNKKD4SDU3TQ","short_pith_number":"pith:7VVYWDRN","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"},"canonical_sha256":"fd6b8b0e2d885b53d5ad5287c90e9b9c0be37522cab27326fd7213d6b514c83d","source":{"kind":"arxiv","id":"1311.0358","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0358","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0358v2","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0358","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"7VVYWDRNRBNV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7VVYWDRNRBNVHVNN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7VVYWDRN","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7VVYWDRNRBNVHVNNKKD4SDU3TQ","target":"record","payload":{"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"},"canonical_sha256":"fd6b8b0e2d885b53d5ad5287c90e9b9c0be37522cab27326fd7213d6b514c83d","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"},"source_kind":"arxiv","source_id":"1311.0358","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-18T02:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMsP4AklWUaaSFagexrGd0yibhAxJUaYGTcwpZko6ycfwFw1yiL28a3ctcHaEjrDbf81KcYQI/CeBIQdNa2XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:24:17.442404Z"},"content_sha256":"d336a3bdbdb7ded157ba61f329dd4f2bdd6e49b56657c8950dd8d06b18f72b88","schema_version":"1.0","event_id":"sha256:d336a3bdbdb7ded157ba61f329dd4f2bdd6e49b56657c8950dd8d06b18f72b88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7VVYWDRNRBNVHVNNKKD4SDU3TQ","target":"graph","payload":{"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"},"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-18T02:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKp+6EYp4MBxUddJr5v57uzYjG+9f3IXTTDTB5ZKituqosqvFWQ5WcjIvglsfZMJJxPTLPjWqKDw6lZaXMV8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T12:24:17.442754Z"},"content_sha256":"e1030e3a3bf9a65eae82eea36f7799d4870208fe57bfbb9f83f5131920645635","schema_version":"1.0","event_id":"sha256:e1030e3a3bf9a65eae82eea36f7799d4870208fe57bfbb9f83f5131920645635"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/bundle.json","state_url":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/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-07-03T12:24:17Z","links":{"resolver":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ","bundle":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/bundle.json","state":"https://pith.science/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VVYWDRNRBNVHVNNKKD4SDU3TQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7VVYWDRNRBNVHVNNKKD4SDU3TQ","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":"cc0a37b359a441a5af805e02b227c14f94f1ff8e365ab37a8a3c38cc76b59d05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:03:10Z","title_canon_sha256":"62025b0ffd801a15875aee6bc8f8f29b6b7a9e1a4eee4004276883078a26ca79"},"schema_version":"1.0","source":{"id":"1311.0358","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.0358","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"1311.0358v2","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.0358","created_at":"2026-05-18T02:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"7VVYWDRNRBNV","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7VVYWDRNRBNVHVNN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7VVYWDRN","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:e1030e3a3bf9a65eae82eea36f7799d4870208fe57bfbb9f83f5131920645635","target":"graph","created_at":"2026-05-18T02:27:18Z","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":"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 ","authors_text":"Hsien-Chih Chang, Hsueh-I Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:03:10Z","title":"A Faster Algorithm to Recognize Even-Hole-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.0358","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:d336a3bdbdb7ded157ba61f329dd4f2bdd6e49b56657c8950dd8d06b18f72b88","target":"record","created_at":"2026-05-18T02:27:18Z","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":"cc0a37b359a441a5af805e02b227c14f94f1ff8e365ab37a8a3c38cc76b59d05","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-02T09:03:10Z","title_canon_sha256":"62025b0ffd801a15875aee6bc8f8f29b6b7a9e1a4eee4004276883078a26ca79"},"schema_version":"1.0","source":{"id":"1311.0358","kind":"arxiv","version":2}},"canonical_sha256":"fd6b8b0e2d885b53d5ad5287c90e9b9c0be37522cab27326fd7213d6b514c83d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd6b8b0e2d885b53d5ad5287c90e9b9c0be37522cab27326fd7213d6b514c83d","first_computed_at":"2026-05-18T02:27:18.990237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:18.990237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6vJp877Lvb6lI8+SJfVhn8WJ3m9TykcXA6K3rgpKMyuUDhREFgH/M2ILayALs8cv1woAdFXMiz7W5ZMz0yWKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:18.990889Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.0358","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d336a3bdbdb7ded157ba61f329dd4f2bdd6e49b56657c8950dd8d06b18f72b88","sha256:e1030e3a3bf9a65eae82eea36f7799d4870208fe57bfbb9f83f5131920645635"],"state_sha256":"c7f5b58931ad6290aff4b37259409e95d9e7c87b0d0025dbd8dbec63cad2f9a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3viXVyvCo8b+mOxphxxh8ocUpUD6cFt/hYC0ldw3H/xnA26evELoRrLvDJsMP4q73El5m9vgw+Mq/f5c4ff/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T12:24:17.444647Z","bundle_sha256":"b37de67977753e6343e627fa48f20ddcca74f3ea713b4c84d5328fd12c7cc226"}}