{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2QHN63MV24GDS76MRFNVHMHTEF","short_pith_number":"pith:2QHN63MV","schema_version":"1.0","canonical_sha256":"d40edf6d95d70c397fcc895b53b0f321486e456065fa84edaf26f28c7b71051b","source":{"kind":"arxiv","id":"2111.06214","version":1},"attestation_state":"computed","paper":{"title":"A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Martinsson","submitted_at":"2021-11-11T14:09:42Z","abstract_excerpt":"We show that any triangle-free graph with maximum degree $\\Delta$ has chromatic number at most $\\left(1+o(1)\\right)\\Delta/\\log \\Delta.$"},"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":"2111.06214","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-11T14:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"86990fbba80394cdfba9720ca9727df320bd565ec8994e5ac8db1c5c81656312","abstract_canon_sha256":"fe0535c6a3a2c9130b5c3159d12e9625493b7f996b1f0766c00116452a8ef7a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:30:59.126560Z","signature_b64":"x5N/Wfwf0ZmebFhfFC1N19AUtFycf9CGr1DKHGy0TYNm0Nx+AmuFFl8xHV4jBoRJUvXEl1nbvxZqvB8N3+KhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d40edf6d95d70c397fcc895b53b0f321486e456065fa84edaf26f28c7b71051b","last_reissued_at":"2026-07-05T03:30:59.126159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:30:59.126159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anders Martinsson","submitted_at":"2021-11-11T14:09:42Z","abstract_excerpt":"We show that any triangle-free graph with maximum degree $\\Delta$ has chromatic number at most $\\left(1+o(1)\\right)\\Delta/\\log \\Delta.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.06214","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2111.06214/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2111.06214","created_at":"2026-07-05T03:30:59.126216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.06214v1","created_at":"2026-07-05T03:30:59.126216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.06214","created_at":"2026-07-05T03:30:59.126216+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QHN63MV24GD","created_at":"2026-07-05T03:30:59.126216+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QHN63MV24GDS76M","created_at":"2026-07-05T03:30:59.126216+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QHN63MV","created_at":"2026-07-05T03:30:59.126216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20648","citing_title":"Fully Dynamic Algorithms for Coloring Triangle-Free Graphs","ref_index":151,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF","json":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF.json","graph_json":"https://pith.science/api/pith-number/2QHN63MV24GDS76MRFNVHMHTEF/graph.json","events_json":"https://pith.science/api/pith-number/2QHN63MV24GDS76MRFNVHMHTEF/events.json","paper":"https://pith.science/paper/2QHN63MV"},"agent_actions":{"view_html":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF","download_json":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF.json","view_paper":"https://pith.science/paper/2QHN63MV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.06214&json=true","fetch_graph":"https://pith.science/api/pith-number/2QHN63MV24GDS76MRFNVHMHTEF/graph.json","fetch_events":"https://pith.science/api/pith-number/2QHN63MV24GDS76MRFNVHMHTEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF/action/storage_attestation","attest_author":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF/action/author_attestation","sign_citation":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF/action/citation_signature","submit_replication":"https://pith.science/pith/2QHN63MV24GDS76MRFNVHMHTEF/action/replication_record"}},"created_at":"2026-07-05T03:30:59.126216+00:00","updated_at":"2026-07-05T03:30:59.126216+00:00"}