{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6VS6ZCWA776ITRJCRJFIJAXSCY","short_pith_number":"pith:6VS6ZCWA","schema_version":"1.0","canonical_sha256":"f565ec8ac0fffc89c5228a4a8482f216079dd8267a20bd47266796797f572708","source":{"kind":"arxiv","id":"1509.06563","version":2},"attestation_state":"computed","paper":{"title":"Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2015-09-22T12:14:04Z","abstract_excerpt":"A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for every positive integer k, every triangle-free graph with sufficiently large chromatic number contains holes of k consecutive lengths."},"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":"1509.06563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-22T12:14:04Z","cross_cats_sorted":[],"title_canon_sha256":"8eafb7cab87d4f7ea34240aa1decf3eb1ddae685528e9f9f578924d909e987f3","abstract_canon_sha256":"acf4fe1a53ac5dd347bc140d9ba48f67a96793c232e5fcbf3b0e1b20c3c1c960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:57.391272Z","signature_b64":"0A9WsPIHuVSba3qIy4ntmJaV7vDslHHJxdRPAj6OLjYSTXOiY7mR6KbK0qIP2Ep/L2UQSNf6jYMqDAtjLTWrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f565ec8ac0fffc89c5228a4a8482f216079dd8267a20bd47266796797f572708","last_reissued_at":"2026-05-18T00:23:57.390619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:57.390619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. IV. Consecutive holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2015-09-22T12:14:04Z","abstract_excerpt":"A hole in a graph is an induced subgraph which is a cycle of length at least four. We prove that for every positive integer k, every triangle-free graph with sufficiently large chromatic number contains holes of k consecutive lengths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06563","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":"1509.06563","created_at":"2026-05-18T00:23:57.390723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06563v2","created_at":"2026-05-18T00:23:57.390723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06563","created_at":"2026-05-18T00:23:57.390723+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VS6ZCWA776I","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VS6ZCWA776ITRJC","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VS6ZCWA","created_at":"2026-05-18T12:29:07.941421+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/6VS6ZCWA776ITRJCRJFIJAXSCY","json":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY.json","graph_json":"https://pith.science/api/pith-number/6VS6ZCWA776ITRJCRJFIJAXSCY/graph.json","events_json":"https://pith.science/api/pith-number/6VS6ZCWA776ITRJCRJFIJAXSCY/events.json","paper":"https://pith.science/paper/6VS6ZCWA"},"agent_actions":{"view_html":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY","download_json":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY.json","view_paper":"https://pith.science/paper/6VS6ZCWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06563&json=true","fetch_graph":"https://pith.science/api/pith-number/6VS6ZCWA776ITRJCRJFIJAXSCY/graph.json","fetch_events":"https://pith.science/api/pith-number/6VS6ZCWA776ITRJCRJFIJAXSCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY/action/storage_attestation","attest_author":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY/action/author_attestation","sign_citation":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY/action/citation_signature","submit_replication":"https://pith.science/pith/6VS6ZCWA776ITRJCRJFIJAXSCY/action/replication_record"}},"created_at":"2026-05-18T00:23:57.390723+00:00","updated_at":"2026-05-18T00:23:57.390723+00:00"}