{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7T3VPYNPY3TAS2ZW42LQI3VS2F","short_pith_number":"pith:7T3VPYNP","schema_version":"1.0","canonical_sha256":"fcf757e1afc6e6096b36e697046eb2d17ab92cccc2e167d3d705656b6e17234e","source":{"kind":"arxiv","id":"1703.03973","version":3},"attestation_state":"computed","paper":{"title":"Separating Tree-chromatic number from Path-chromatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fidel Barrera-Cruz, Heather Smith, Libby Taylor, Piotr Micek, Stefan Felsner, Tam\\'as M\\'esz\\'aros, William T. Trotter","submitted_at":"2017-03-11T14:15:04Z","abstract_excerpt":"We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour."},"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":"1703.03973","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-11T14:15:04Z","cross_cats_sorted":[],"title_canon_sha256":"04394ef819a76d4393446560c758f3e905bd9742f0641220c78665b239e67de6","abstract_canon_sha256":"2316051ce3a0390d42fddcbdd818706b4593f81c3985ce5861152ef2275f813d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:05.416135Z","signature_b64":"kry+E3Wts5c0PZaKQoqhi1KIzlSLnud5WEp7Axlla6Cx9Pni3ojLEjdlndiDkdaqIPxHgvRiJ79LKspVuQbLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcf757e1afc6e6096b36e697046eb2d17ab92cccc2e167d3d705656b6e17234e","last_reissued_at":"2026-05-17T23:55:05.415747Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:05.415747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating Tree-chromatic number from Path-chromatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fidel Barrera-Cruz, Heather Smith, Libby Taylor, Piotr Micek, Stefan Felsner, Tam\\'as M\\'esz\\'aros, William T. Trotter","submitted_at":"2017-03-11T14:15:04Z","abstract_excerpt":"We apply Ramsey theoretic tools to show that there is a family of graphs which have tree-chromatic number at most~$2$ while the path-chromatic number is unbounded. This resolves a problem posed by Seymour."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03973","kind":"arxiv","version":3},"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":"1703.03973","created_at":"2026-05-17T23:55:05.415816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03973v3","created_at":"2026-05-17T23:55:05.415816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03973","created_at":"2026-05-17T23:55:05.415816+00:00"},{"alias_kind":"pith_short_12","alias_value":"7T3VPYNPY3TA","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7T3VPYNPY3TAS2ZW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7T3VPYNP","created_at":"2026-05-18T12:31:05.417338+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/7T3VPYNPY3TAS2ZW42LQI3VS2F","json":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F.json","graph_json":"https://pith.science/api/pith-number/7T3VPYNPY3TAS2ZW42LQI3VS2F/graph.json","events_json":"https://pith.science/api/pith-number/7T3VPYNPY3TAS2ZW42LQI3VS2F/events.json","paper":"https://pith.science/paper/7T3VPYNP"},"agent_actions":{"view_html":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F","download_json":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F.json","view_paper":"https://pith.science/paper/7T3VPYNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03973&json=true","fetch_graph":"https://pith.science/api/pith-number/7T3VPYNPY3TAS2ZW42LQI3VS2F/graph.json","fetch_events":"https://pith.science/api/pith-number/7T3VPYNPY3TAS2ZW42LQI3VS2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F/action/storage_attestation","attest_author":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F/action/author_attestation","sign_citation":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F/action/citation_signature","submit_replication":"https://pith.science/pith/7T3VPYNPY3TAS2ZW42LQI3VS2F/action/replication_record"}},"created_at":"2026-05-17T23:55:05.415816+00:00","updated_at":"2026-05-17T23:55:05.415816+00:00"}