{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UEA7QVJVALXHBSKS733CIX5B4I","short_pith_number":"pith:UEA7QVJV","schema_version":"1.0","canonical_sha256":"a101f8553502ee70c952fef6245fa1e2137465a2bfe2036b209f65d54093536e","source":{"kind":"arxiv","id":"1202.4032","version":1},"attestation_state":"computed","paper":{"title":"b-coloring graphs with large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ana Silva, Victor Campos, Victor Farias","submitted_at":"2012-02-17T22:38:19Z","abstract_excerpt":"A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex that has a neighbor in all other classes. The b-chromatic number of a graph is the largest integer k such that the graph has a b-coloring with k colors. We show how to compute in polynomial time the b-chromatic number of a graph of girth at least 9. This improves the seminal result of Irving and Manlove on trees."},"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":"1202.4032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-17T22:38:19Z","cross_cats_sorted":[],"title_canon_sha256":"0f785f72599b04bb692e39fd0932c9432492f21220f752f7ee3ccd7c31aec2e0","abstract_canon_sha256":"c942035e7c0d5ff0d82876db5388eb6b118ff6816dada713832873dc543b7d49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:01.507378Z","signature_b64":"QqpwtE4nuPprY6PPjn9j9UqXNLOwD7I0MMTW0bVGd6XdRxzFIHF1tjBCq7FFx+zeO2iRQ71knZM2+88/ek4fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a101f8553502ee70c952fef6245fa1e2137465a2bfe2036b209f65d54093536e","last_reissued_at":"2026-05-18T04:02:01.506521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:01.506521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"b-coloring graphs with large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ana Silva, Victor Campos, Victor Farias","submitted_at":"2012-02-17T22:38:19Z","abstract_excerpt":"A b-coloring of a graph is a coloring of its vertices such that every color class contains a vertex that has a neighbor in all other classes. The b-chromatic number of a graph is the largest integer k such that the graph has a b-coloring with k colors. We show how to compute in polynomial time the b-chromatic number of a graph of girth at least 9. This improves the seminal result of Irving and Manlove on trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4032","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":"1202.4032","created_at":"2026-05-18T04:02:01.506655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4032v1","created_at":"2026-05-18T04:02:01.506655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4032","created_at":"2026-05-18T04:02:01.506655+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEA7QVJVALXH","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEA7QVJVALXHBSKS","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEA7QVJV","created_at":"2026-05-18T12:27:23.164592+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/UEA7QVJVALXHBSKS733CIX5B4I","json":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I.json","graph_json":"https://pith.science/api/pith-number/UEA7QVJVALXHBSKS733CIX5B4I/graph.json","events_json":"https://pith.science/api/pith-number/UEA7QVJVALXHBSKS733CIX5B4I/events.json","paper":"https://pith.science/paper/UEA7QVJV"},"agent_actions":{"view_html":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I","download_json":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I.json","view_paper":"https://pith.science/paper/UEA7QVJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4032&json=true","fetch_graph":"https://pith.science/api/pith-number/UEA7QVJVALXHBSKS733CIX5B4I/graph.json","fetch_events":"https://pith.science/api/pith-number/UEA7QVJVALXHBSKS733CIX5B4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I/action/storage_attestation","attest_author":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I/action/author_attestation","sign_citation":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I/action/citation_signature","submit_replication":"https://pith.science/pith/UEA7QVJVALXHBSKS733CIX5B4I/action/replication_record"}},"created_at":"2026-05-18T04:02:01.506655+00:00","updated_at":"2026-05-18T04:02:01.506655+00:00"}