{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:37TCZU3AH2GTINSSFNL7MHZWXT","short_pith_number":"pith:37TCZU3A","schema_version":"1.0","canonical_sha256":"dfe62cd3603e8d3436522b57f61f36bcd7ea6a54961bff4e52e7a9c7708c10ca","source":{"kind":"arxiv","id":"1409.2922","version":1},"attestation_state":"computed","paper":{"title":"Trees, ladders and graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"D\\'aniel T. Soukup","submitted_at":"2014-09-09T23:50:55Z","abstract_excerpt":"We introduce a new method to construct uncountably chromatic graphs from non special trees and ladder systems. Answering a question of P. Erd\\H{o}s and A. Hajnal from 1985, we construct graphs of chromatic number $\\omega_1$ without uncountable $\\omega$-connected subgraphs. Second, we build triangle free graphs of chromatic number $\\omega_1$ without subgraphs isomorphic to $H_{\\omega,\\omega+2}$."},"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":"1409.2922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-09T23:50:55Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"84e16efb33575bf7febb13e88a543d31c5c1e2d0f061b5b5151815b78fe0d05f","abstract_canon_sha256":"2fc6909a7fea933db2e814678bbdc97de639433713e37f3a3402fb7e48084587"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:08.733260Z","signature_b64":"K0jPbuoR//3jC/yjcFcelyRduWMXkGG78+pa7oC3DLwmih4vc3IgbWygpbwxWHZQHRCgfVaomC6DHbc2nzuJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfe62cd3603e8d3436522b57f61f36bcd7ea6a54961bff4e52e7a9c7708c10ca","last_reissued_at":"2026-05-18T02:43:08.732734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:08.732734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees, ladders and graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"D\\'aniel T. Soukup","submitted_at":"2014-09-09T23:50:55Z","abstract_excerpt":"We introduce a new method to construct uncountably chromatic graphs from non special trees and ladder systems. Answering a question of P. Erd\\H{o}s and A. Hajnal from 1985, we construct graphs of chromatic number $\\omega_1$ without uncountable $\\omega$-connected subgraphs. Second, we build triangle free graphs of chromatic number $\\omega_1$ without subgraphs isomorphic to $H_{\\omega,\\omega+2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2922","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":"1409.2922","created_at":"2026-05-18T02:43:08.732843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2922v1","created_at":"2026-05-18T02:43:08.732843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2922","created_at":"2026-05-18T02:43:08.732843+00:00"},{"alias_kind":"pith_short_12","alias_value":"37TCZU3AH2GT","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"37TCZU3AH2GTINSS","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"37TCZU3A","created_at":"2026-05-18T12:28:11.866339+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/37TCZU3AH2GTINSSFNL7MHZWXT","json":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT.json","graph_json":"https://pith.science/api/pith-number/37TCZU3AH2GTINSSFNL7MHZWXT/graph.json","events_json":"https://pith.science/api/pith-number/37TCZU3AH2GTINSSFNL7MHZWXT/events.json","paper":"https://pith.science/paper/37TCZU3A"},"agent_actions":{"view_html":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT","download_json":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT.json","view_paper":"https://pith.science/paper/37TCZU3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2922&json=true","fetch_graph":"https://pith.science/api/pith-number/37TCZU3AH2GTINSSFNL7MHZWXT/graph.json","fetch_events":"https://pith.science/api/pith-number/37TCZU3AH2GTINSSFNL7MHZWXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT/action/storage_attestation","attest_author":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT/action/author_attestation","sign_citation":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT/action/citation_signature","submit_replication":"https://pith.science/pith/37TCZU3AH2GTINSSFNL7MHZWXT/action/replication_record"}},"created_at":"2026-05-18T02:43:08.732843+00:00","updated_at":"2026-05-18T02:43:08.732843+00:00"}