{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AQ3OXOO24NMBZXONRX5UNVEUQO","short_pith_number":"pith:AQ3OXOO2","schema_version":"1.0","canonical_sha256":"0436ebb9dae3581cddcd8dfb46d49483900d9bb0ab60d7ee3f7eb72470917a32","source":{"kind":"arxiv","id":"1512.03481","version":1},"attestation_state":"computed","paper":{"title":"Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilkyoo Choi, O-joung Kwon, Sang-il Oum","submitted_at":"2015-12-10T23:11:08Z","abstract_excerpt":"A fan $F_k$ is a graph that consists of an induced path on $k$ vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive integers $q$ and $k$, every graph with sufficiently large chromatic number contains either a clique of size $q$ or a vertex-minor isomorphic to $F_k$. We also prove that for all positive integers $q$ and $k\\ge 3$, every graph with sufficiently large chromatic number contains either a clique of size $q$ or a pivot-minor isomorphic to a cycle of length $k$."},"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":"1512.03481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-10T23:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"16b5596753e9b645e08e01278e35f6e8b9152711ee55c6d2cb10453594268f26","abstract_canon_sha256":"0eb9a86521f1997276539d5a0bcb2e93bb2754813eefa84033ba34b765dde0de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:58.106763Z","signature_b64":"fjTV6m3LVwTwEvc8HXneUzqBf+BrhKX4Jt+k/ne7t58qMKVBaalc954bZODP9NjEpsWJsRennX1V18EvPq/hAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0436ebb9dae3581cddcd8dfb46d49483900d9bb0ab60d7ee3f7eb72470917a32","last_reissued_at":"2026-05-18T00:34:58.106037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:58.106037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ilkyoo Choi, O-joung Kwon, Sang-il Oum","submitted_at":"2015-12-10T23:11:08Z","abstract_excerpt":"A fan $F_k$ is a graph that consists of an induced path on $k$ vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive integers $q$ and $k$, every graph with sufficiently large chromatic number contains either a clique of size $q$ or a vertex-minor isomorphic to $F_k$. We also prove that for all positive integers $q$ and $k\\ge 3$, every graph with sufficiently large chromatic number contains either a clique of size $q$ or a pivot-minor isomorphic to a cycle of length $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03481","kind":"arxiv","version":1},"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":"1512.03481","created_at":"2026-05-18T00:34:58.106166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03481v1","created_at":"2026-05-18T00:34:58.106166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03481","created_at":"2026-05-18T00:34:58.106166+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQ3OXOO24NMB","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQ3OXOO24NMBZXON","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQ3OXOO2","created_at":"2026-05-18T12:29:10.953037+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/AQ3OXOO24NMBZXONRX5UNVEUQO","json":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO.json","graph_json":"https://pith.science/api/pith-number/AQ3OXOO24NMBZXONRX5UNVEUQO/graph.json","events_json":"https://pith.science/api/pith-number/AQ3OXOO24NMBZXONRX5UNVEUQO/events.json","paper":"https://pith.science/paper/AQ3OXOO2"},"agent_actions":{"view_html":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO","download_json":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO.json","view_paper":"https://pith.science/paper/AQ3OXOO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03481&json=true","fetch_graph":"https://pith.science/api/pith-number/AQ3OXOO24NMBZXONRX5UNVEUQO/graph.json","fetch_events":"https://pith.science/api/pith-number/AQ3OXOO24NMBZXONRX5UNVEUQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO/action/storage_attestation","attest_author":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO/action/author_attestation","sign_citation":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO/action/citation_signature","submit_replication":"https://pith.science/pith/AQ3OXOO24NMBZXONRX5UNVEUQO/action/replication_record"}},"created_at":"2026-05-18T00:34:58.106166+00:00","updated_at":"2026-05-18T00:34:58.106166+00:00"}