{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TGNSSUJQGPPLX7UGXODRKWVQLD","short_pith_number":"pith:TGNSSUJQ","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"},"canonical_sha256":"999b29513033debbfe86bb87155ab058f1b68f00116384040271ea7f4c98cfc7","source":{"kind":"arxiv","id":"1103.6222","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.6222","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.6222v2","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6222","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"TGNSSUJQGPPL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGNSSUJQGPPLX7UG","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGNSSUJQ","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TGNSSUJQGPPLX7UGXODRKWVQLD","target":"record","payload":{"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"},"canonical_sha256":"999b29513033debbfe86bb87155ab058f1b68f00116384040271ea7f4c98cfc7","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"},"source_kind":"arxiv","source_id":"1103.6222","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-18T04:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xPeoHIe6Q9kdRygnoJc4cl5VbDkPvxex0epU8xhmW46INiXtQPDSWzmJ/piTB1e/7CCr8mT0L7ntDctsOygiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:32:07.086869Z"},"content_sha256":"238d07e213b9f761a6239636b69bf1319a551b46418dd0f029a59e66cc82d854","schema_version":"1.0","event_id":"sha256:238d07e213b9f761a6239636b69bf1319a551b46418dd0f029a59e66cc82d854"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TGNSSUJQGPPLX7UGXODRKWVQLD","target":"graph","payload":{"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"},"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-18T04:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgD9mQiT5e9TFNe489TWE8MGz5dbxZpJzlxKh9fIhV+gOhlXD9fRSlYGXXDxUZGCAKM1+cMTCTC12EH3or8nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:32:07.087215Z"},"content_sha256":"785a6f36eb58310057e922ef7ae4a902aa1ea1a557a5ab1ff36c0396965ef211","schema_version":"1.0","event_id":"sha256:785a6f36eb58310057e922ef7ae4a902aa1ea1a557a5ab1ff36c0396965ef211"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/bundle.json","state_url":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/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-01T12:32:07Z","links":{"resolver":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD","bundle":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/bundle.json","state":"https://pith.science/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGNSSUJQGPPLX7UGXODRKWVQLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TGNSSUJQGPPLX7UGXODRKWVQLD","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":"3bbf502a5e741a5e1525a61391c970d1ab244f6214a9e90d7c613ef795f98e46","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-31T15:57:53Z","title_canon_sha256":"3ae01333df98c6109b4077820dd50e649f7fc521e3253cf6c97a0d70e77a3478"},"schema_version":"1.0","source":{"id":"1103.6222","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.6222","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1103.6222v2","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6222","created_at":"2026-05-18T04:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"TGNSSUJQGPPL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGNSSUJQGPPLX7UG","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGNSSUJQ","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:785a6f36eb58310057e922ef7ae4a902aa1ea1a557a5ab1ff36c0396965ef211","target":"graph","created_at":"2026-05-18T04:21:22Z","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":"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^","authors_text":"Andrew D. King, W. Sean Kennedy","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-31T15:57:53Z","title":"Finding a smallest odd hole in a claw-free graph using global structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6222","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:238d07e213b9f761a6239636b69bf1319a551b46418dd0f029a59e66cc82d854","target":"record","created_at":"2026-05-18T04:21:22Z","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":"3bbf502a5e741a5e1525a61391c970d1ab244f6214a9e90d7c613ef795f98e46","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-03-31T15:57:53Z","title_canon_sha256":"3ae01333df98c6109b4077820dd50e649f7fc521e3253cf6c97a0d70e77a3478"},"schema_version":"1.0","source":{"id":"1103.6222","kind":"arxiv","version":2}},"canonical_sha256":"999b29513033debbfe86bb87155ab058f1b68f00116384040271ea7f4c98cfc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"999b29513033debbfe86bb87155ab058f1b68f00116384040271ea7f4c98cfc7","first_computed_at":"2026-05-18T04:21:22.159890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:22.159890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWgn2O+nbUccJBYWl09xpAFvsBG1KK1uDJisW9UUuW1iT5e8H5FLA28bL+U5nZh45b47bsN0LgdzO5Bx3lMtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:22.160376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.6222","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:238d07e213b9f761a6239636b69bf1319a551b46418dd0f029a59e66cc82d854","sha256:785a6f36eb58310057e922ef7ae4a902aa1ea1a557a5ab1ff36c0396965ef211"],"state_sha256":"a8898108fed1fc958c5e5d9cf06067ccef5ad5e74c0aded33a4cf8dfcd4d30fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DGX9hN+TOje0Udeocs5LHGDsFoX46LS9GT0MCBnxdZrYQFjvLYu66HT0G1Hw83ZGhAYSptxVZW5UNah9wp0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:32:07.089202Z","bundle_sha256":"642e175d433ed8099fcd1688cbb88c1cb9540ef7887fb346de08439a9721f368"}}