{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TGNSSUJQGPPLX7UGXODRKWVQLD","short_pith_number":"pith:TGNSSUJQ","schema_version":"1.0","canonical_sha256":"999b29513033debbfe86bb87155ab058f1b68f00116384040271ea7f4c98cfc7","source":{"kind":"arxiv","id":"1103.6222","version":2},"attestation_state":"computed","paper":{"title":"Finding a smallest odd hole in a claw-free graph using global structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew D. King, W. Sean Kennedy","submitted_at":"2011-03-31T15:57:53Z","abstract_excerpt":"A lemma of Fouquet implies that a claw-free graph contains an induced $C_5$, contains no odd hole, or is quasi-line. In this paper we use this result to give an improved shortest-odd-hole algorithm for claw-free graphs by exploiting the structural relationship between line graphs and quasi-line graphs suggested by Chudnovsky and Seymour's structure theorem for quasi-line graphs. Our approach involves reducing the problem to that of finding a shortest odd cycle of length $\\geq 5$ in a graph. Our algorithm runs in $O(m^2+n^2\\log n)$ time, improving upon Shrem, Stern, and Golumbic's recent $O(nm^"},"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":"1103.6222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-31T15:57:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3ae01333df98c6109b4077820dd50e649f7fc521e3253cf6c97a0d70e77a3478","abstract_canon_sha256":"3bbf502a5e741a5e1525a61391c970d1ab244f6214a9e90d7c613ef795f98e46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:22.160376Z","signature_b64":"IWgn2O+nbUccJBYWl09xpAFvsBG1KK1uDJisW9UUuW1iT5e8H5FLA28bL+U5nZh45b47bsN0LgdzO5Bx3lMtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"999b29513033debbfe86bb87155ab058f1b68f00116384040271ea7f4c98cfc7","last_reissued_at":"2026-05-18T04:21:22.159890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:22.159890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a smallest odd hole in a claw-free graph using global structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrew D. King, W. Sean Kennedy","submitted_at":"2011-03-31T15:57:53Z","abstract_excerpt":"A lemma of Fouquet implies that a claw-free graph contains an induced $C_5$, contains no odd hole, or is quasi-line. In this paper we use this result to give an improved shortest-odd-hole algorithm for claw-free graphs by exploiting the structural relationship between line graphs and quasi-line graphs suggested by Chudnovsky and Seymour's structure theorem for quasi-line graphs. Our approach involves reducing the problem to that of finding a shortest odd cycle of length $\\geq 5$ in a graph. Our algorithm runs in $O(m^2+n^2\\log n)$ time, improving upon Shrem, Stern, and Golumbic's recent $O(nm^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6222","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":"1103.6222","created_at":"2026-05-18T04:21:22.159961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.6222v2","created_at":"2026-05-18T04:21:22.159961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6222","created_at":"2026-05-18T04:21:22.159961+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGNSSUJQGPPL","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGNSSUJQGPPLX7UG","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGNSSUJQ","created_at":"2026-05-18T12:26:42.757692+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/TGNSSUJQGPPLX7UGXODRKWVQLD","json":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD.json","graph_json":"https://pith.science/api/pith-number/TGNSSUJQGPPLX7UGXODRKWVQLD/graph.json","events_json":"https://pith.science/api/pith-number/TGNSSUJQGPPLX7UGXODRKWVQLD/events.json","paper":"https://pith.science/paper/TGNSSUJQ"},"agent_actions":{"view_html":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD","download_json":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD.json","view_paper":"https://pith.science/paper/TGNSSUJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.6222&json=true","fetch_graph":"https://pith.science/api/pith-number/TGNSSUJQGPPLX7UGXODRKWVQLD/graph.json","fetch_events":"https://pith.science/api/pith-number/TGNSSUJQGPPLX7UGXODRKWVQLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/action/storage_attestation","attest_author":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/action/author_attestation","sign_citation":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/action/citation_signature","submit_replication":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/action/replication_record"}},"created_at":"2026-05-18T04:21:22.159961+00:00","updated_at":"2026-05-18T04:21:22.159961+00:00"}