{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HNAH6MAPP6MUAXG2MUDQJ33M3D","short_pith_number":"pith:HNAH6MAP","schema_version":"1.0","canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","source":{"kind":"arxiv","id":"1605.06574","version":2},"attestation_state":"computed","paper":{"title":"On the strong chromatic number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2016-05-21T02:27:02Z","abstract_excerpt":"The strong chromatic number, $\\chi_S(G)$, of an $n$-vertex graph $G$ is the smallest number $k$ such that after adding $k\\lceil n/k\\rceil-n$ isolated vertices to $G$ and considering {\\bf any} partition of the vertices of the resulting graph into disjoint subsets $V_1, \\ldots, V_{\\lceil n/k\\rceil}$ of size $k$ each, one can find a proper $k$-vertex-coloring of the graph such that each part $V_i$, $i=1, \\ldots, \\lceil n/k\\rceil$, contains exactly one vertex of each color.\n  For any graph $G$ with maximum degree $\\Delta$, it is easy to see that $\\chi_S(G)\\geq\\Delta+1$. Recently, Haxell proved tha"},"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":"1605.06574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c3a29ae8ea0ac8729097e2786b77e88db269b5446be90b9d2952ffb63aa4b93","abstract_canon_sha256":"c7952580fbce78e7a402633599042dde8940816ae4610b92541452b5afe9ac75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:46.753555Z","signature_b64":"MxcnJUiAjcWxgrKLOLHx8Xvi0duzBBkRiGo7QCyF2ZLrcEVjuaPjU9xDGeruOt1TmKyWoEsjfWOmp8U+OXNZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","last_reissued_at":"2026-05-18T01:13:46.752906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:46.752906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the strong chromatic number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2016-05-21T02:27:02Z","abstract_excerpt":"The strong chromatic number, $\\chi_S(G)$, of an $n$-vertex graph $G$ is the smallest number $k$ such that after adding $k\\lceil n/k\\rceil-n$ isolated vertices to $G$ and considering {\\bf any} partition of the vertices of the resulting graph into disjoint subsets $V_1, \\ldots, V_{\\lceil n/k\\rceil}$ of size $k$ each, one can find a proper $k$-vertex-coloring of the graph such that each part $V_i$, $i=1, \\ldots, \\lceil n/k\\rceil$, contains exactly one vertex of each color.\n  For any graph $G$ with maximum degree $\\Delta$, it is easy to see that $\\chi_S(G)\\geq\\Delta+1$. Recently, Haxell proved tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06574","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":"1605.06574","created_at":"2026-05-18T01:13:46.753009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06574v2","created_at":"2026-05-18T01:13:46.753009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06574","created_at":"2026-05-18T01:13:46.753009+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNAH6MAPP6MU","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNAH6MAPP6MUAXG2","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNAH6MAP","created_at":"2026-05-18T12:30:19.053100+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/HNAH6MAPP6MUAXG2MUDQJ33M3D","json":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D.json","graph_json":"https://pith.science/api/pith-number/HNAH6MAPP6MUAXG2MUDQJ33M3D/graph.json","events_json":"https://pith.science/api/pith-number/HNAH6MAPP6MUAXG2MUDQJ33M3D/events.json","paper":"https://pith.science/paper/HNAH6MAP"},"agent_actions":{"view_html":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D","download_json":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D.json","view_paper":"https://pith.science/paper/HNAH6MAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06574&json=true","fetch_graph":"https://pith.science/api/pith-number/HNAH6MAPP6MUAXG2MUDQJ33M3D/graph.json","fetch_events":"https://pith.science/api/pith-number/HNAH6MAPP6MUAXG2MUDQJ33M3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/action/storage_attestation","attest_author":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/action/author_attestation","sign_citation":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/action/citation_signature","submit_replication":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/action/replication_record"}},"created_at":"2026-05-18T01:13:46.753009+00:00","updated_at":"2026-05-18T01:13:46.753009+00:00"}