{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:D3BSDTNOA7L6IEPIW64N3IBT7F","short_pith_number":"pith:D3BSDTNO","schema_version":"1.0","canonical_sha256":"1ec321cdae07d7e411e8b7b8dda033f96e8e0a2123ec80bdd2a506e1f0933472","source":{"kind":"arxiv","id":"1412.8002","version":2},"attestation_state":"computed","paper":{"title":"Coloring, sparseness, and girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Benjamin Reiniger, Douglas B. West, Noga Alon, Xuding Zhu","submitted_at":"2014-12-26T23:39:01Z","abstract_excerpt":"An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\\in\\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow extremely rapidly in terms of the girth.\n  Using the resulting graphs, we construct sparse non-$k$-choosable bipartite graphs, showing that maximum average degree at most $2(k-1)$ is a sharp sufficient condition for $k$-choosability in bipartite graphs, even when requiring large girth. We also give a new simple construction of non-$k$-colorable graphs and hype"},"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":"1412.8002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-26T23:39:01Z","cross_cats_sorted":[],"title_canon_sha256":"18805c3f9df5b014d5824e87d1922315b032483b460f9fc3b5a9c7d966e16161","abstract_canon_sha256":"d8c7dc6357c1aaaa6cec39482a270c0194fb6959ef4080f48a6db298a179f824"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:22.383159Z","signature_b64":"vE3nvvy1FbcSBMDTaczwZsbqpB6qh9/mPWt4fCH89RZwU/akKsljrK7czxGR4knOPpavp9+ARn8i0lBU892mDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec321cdae07d7e411e8b7b8dda033f96e8e0a2123ec80bdd2a506e1f0933472","last_reissued_at":"2026-05-18T02:17:22.382532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:22.382532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring, sparseness, and girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Benjamin Reiniger, Douglas B. West, Noga Alon, Xuding Zhu","submitted_at":"2014-12-26T23:39:01Z","abstract_excerpt":"An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\\in\\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow extremely rapidly in terms of the girth.\n  Using the resulting graphs, we construct sparse non-$k$-choosable bipartite graphs, showing that maximum average degree at most $2(k-1)$ is a sharp sufficient condition for $k$-choosability in bipartite graphs, even when requiring large girth. We also give a new simple construction of non-$k$-colorable graphs and hype"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8002","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":"1412.8002","created_at":"2026-05-18T02:17:22.382630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8002v2","created_at":"2026-05-18T02:17:22.382630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8002","created_at":"2026-05-18T02:17:22.382630+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3BSDTNOA7L6","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3BSDTNOA7L6IEPI","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3BSDTNO","created_at":"2026-05-18T12:28:25.294606+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/D3BSDTNOA7L6IEPIW64N3IBT7F","json":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F.json","graph_json":"https://pith.science/api/pith-number/D3BSDTNOA7L6IEPIW64N3IBT7F/graph.json","events_json":"https://pith.science/api/pith-number/D3BSDTNOA7L6IEPIW64N3IBT7F/events.json","paper":"https://pith.science/paper/D3BSDTNO"},"agent_actions":{"view_html":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F","download_json":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F.json","view_paper":"https://pith.science/paper/D3BSDTNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8002&json=true","fetch_graph":"https://pith.science/api/pith-number/D3BSDTNOA7L6IEPIW64N3IBT7F/graph.json","fetch_events":"https://pith.science/api/pith-number/D3BSDTNOA7L6IEPIW64N3IBT7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F/action/storage_attestation","attest_author":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F/action/author_attestation","sign_citation":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F/action/citation_signature","submit_replication":"https://pith.science/pith/D3BSDTNOA7L6IEPIW64N3IBT7F/action/replication_record"}},"created_at":"2026-05-18T02:17:22.382630+00:00","updated_at":"2026-05-18T02:17:22.382630+00:00"}