{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:L5BEZWBSA7Q2MJ2AMWAT27STLJ","short_pith_number":"pith:L5BEZWBS","schema_version":"1.0","canonical_sha256":"5f424cd83207e1a6274065813d7e535a7e13e556bb4229a9214c0406acb77a12","source":{"kind":"arxiv","id":"1708.06929","version":1},"attestation_state":"computed","paper":{"title":"Reflection on the coloring and chromatic numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Assaf Rinot, Chris Lambie-Hanson","submitted_at":"2017-08-23T09:27:36Z","abstract_excerpt":"We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) is compatible with each of the following compactness principles: Rado's conjecture, Fodor-type reflection, $\\Delta$-reflection, Stationary-sets reflection, Martin's Maximum, and a generalized Chang's conjecture. This is accomplished by showing that, under $\\mathrm{GCH}$-type assumptions, instances of incompactness for the chromatic number can be derived from square-like pri"},"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":"1708.06929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-08-23T09:27:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3c627f79b13d19ed0c5bc729b80067f5fd79f936195787b6f1ae5f45de693ceb","abstract_canon_sha256":"773f79dc45627c3cd53344e0fea977352343bc7c506b53344138d40f41260894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.856067Z","signature_b64":"pbbALUzaZX+QahUEYaOr2px+GDkKW07TNsQ/8QnMu31dL8SLAfQwHbRucj30PtJUBOjY3oQXU7vjfcnaVzaxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f424cd83207e1a6274065813d7e535a7e13e556bb4229a9214c0406acb77a12","last_reissued_at":"2026-05-18T00:36:48.855397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.855397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reflection on the coloring and chromatic numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Assaf Rinot, Chris Lambie-Hanson","submitted_at":"2017-08-23T09:27:36Z","abstract_excerpt":"We prove that reflection of the coloring number of graphs is consistent with non-reflection of the chromatic number. Moreover, it is proved that incompactness for the chromatic number of graphs (with arbitrarily large gaps) is compatible with each of the following compactness principles: Rado's conjecture, Fodor-type reflection, $\\Delta$-reflection, Stationary-sets reflection, Martin's Maximum, and a generalized Chang's conjecture. This is accomplished by showing that, under $\\mathrm{GCH}$-type assumptions, instances of incompactness for the chromatic number can be derived from square-like pri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06929","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":"1708.06929","created_at":"2026-05-18T00:36:48.855496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06929v1","created_at":"2026-05-18T00:36:48.855496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06929","created_at":"2026-05-18T00:36:48.855496+00:00"},{"alias_kind":"pith_short_12","alias_value":"L5BEZWBSA7Q2","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"L5BEZWBSA7Q2MJ2A","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"L5BEZWBS","created_at":"2026-05-18T12:31:28.150371+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/L5BEZWBSA7Q2MJ2AMWAT27STLJ","json":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ.json","graph_json":"https://pith.science/api/pith-number/L5BEZWBSA7Q2MJ2AMWAT27STLJ/graph.json","events_json":"https://pith.science/api/pith-number/L5BEZWBSA7Q2MJ2AMWAT27STLJ/events.json","paper":"https://pith.science/paper/L5BEZWBS"},"agent_actions":{"view_html":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ","download_json":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ.json","view_paper":"https://pith.science/paper/L5BEZWBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06929&json=true","fetch_graph":"https://pith.science/api/pith-number/L5BEZWBSA7Q2MJ2AMWAT27STLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/L5BEZWBSA7Q2MJ2AMWAT27STLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ/action/storage_attestation","attest_author":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ/action/author_attestation","sign_citation":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ/action/citation_signature","submit_replication":"https://pith.science/pith/L5BEZWBSA7Q2MJ2AMWAT27STLJ/action/replication_record"}},"created_at":"2026-05-18T00:36:48.855496+00:00","updated_at":"2026-05-18T00:36:48.855496+00:00"}