{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VA3XQOBLNPDZONSDVG3WCMYCYJ","short_pith_number":"pith:VA3XQOBL","schema_version":"1.0","canonical_sha256":"a83778382b6bc7973643a9b7613302c2433ad593730fa0eea6ab5e2fd8ec51cc","source":{"kind":"arxiv","id":"1511.00537","version":2},"attestation_state":"computed","paper":{"title":"Upper bounds for the achromatic and coloring numbers of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Clive Elphick","submitted_at":"2015-11-02T15:05:20Z","abstract_excerpt":"Dvo\\v{r}\\'ak \\emph{et al.} introduced a variant of the Randi\\'c index of a graph $G$, denoted by $R'(G)$, where $R'(G)=\\sum_{uv\\in E(G)}\\frac 1 {\\max\\{d(u), d(v)\\}}$, and $d(u)$ denotes the degree of a vertex $u$ in $G$. The coloring number $col(G)$ of a graph $G$ is the smallest number $k$ for which there exists a linear ordering of the vertices of $G$ such that each vertex is preceded by fewer than $k$ of its neighbors. It is well-known that $\\chi(G)\\leq col(G)$ for any graph $G$, where $\\chi(G)$ denotes the chromatic number of $G$. In this note, we show that for any graph $G$ without isolat"},"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":"1511.00537","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-02T15:05:20Z","cross_cats_sorted":[],"title_canon_sha256":"724f896b32c817d61ee213c1e5a30005f90c562ef639782a4b877f479eaf62eb","abstract_canon_sha256":"f19960de8229bdce4e3357afe342f338cac65ce66f0ed8a2986758fb93f4a059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:45.474369Z","signature_b64":"XvNZoHcVl6SO/E0Fa6TXszdfuG7qLhVKUKbJ1uDEi67PyytxdwZG6jJT691huWim5zNCWkrK1eZyr3yp0CfmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a83778382b6bc7973643a9b7613302c2433ad593730fa0eea6ab5e2fd8ec51cc","last_reissued_at":"2026-05-18T01:27:45.473707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:45.473707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds for the achromatic and coloring numbers of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baoyindureng Wu, Clive Elphick","submitted_at":"2015-11-02T15:05:20Z","abstract_excerpt":"Dvo\\v{r}\\'ak \\emph{et al.} introduced a variant of the Randi\\'c index of a graph $G$, denoted by $R'(G)$, where $R'(G)=\\sum_{uv\\in E(G)}\\frac 1 {\\max\\{d(u), d(v)\\}}$, and $d(u)$ denotes the degree of a vertex $u$ in $G$. The coloring number $col(G)$ of a graph $G$ is the smallest number $k$ for which there exists a linear ordering of the vertices of $G$ such that each vertex is preceded by fewer than $k$ of its neighbors. It is well-known that $\\chi(G)\\leq col(G)$ for any graph $G$, where $\\chi(G)$ denotes the chromatic number of $G$. In this note, we show that for any graph $G$ without isolat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00537","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":"1511.00537","created_at":"2026-05-18T01:27:45.473807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00537v2","created_at":"2026-05-18T01:27:45.473807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00537","created_at":"2026-05-18T01:27:45.473807+00:00"},{"alias_kind":"pith_short_12","alias_value":"VA3XQOBLNPDZ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VA3XQOBLNPDZONSD","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VA3XQOBL","created_at":"2026-05-18T12:29:44.643036+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/VA3XQOBLNPDZONSDVG3WCMYCYJ","json":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ.json","graph_json":"https://pith.science/api/pith-number/VA3XQOBLNPDZONSDVG3WCMYCYJ/graph.json","events_json":"https://pith.science/api/pith-number/VA3XQOBLNPDZONSDVG3WCMYCYJ/events.json","paper":"https://pith.science/paper/VA3XQOBL"},"agent_actions":{"view_html":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ","download_json":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ.json","view_paper":"https://pith.science/paper/VA3XQOBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00537&json=true","fetch_graph":"https://pith.science/api/pith-number/VA3XQOBLNPDZONSDVG3WCMYCYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VA3XQOBLNPDZONSDVG3WCMYCYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ/action/storage_attestation","attest_author":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ/action/author_attestation","sign_citation":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ/action/citation_signature","submit_replication":"https://pith.science/pith/VA3XQOBLNPDZONSDVG3WCMYCYJ/action/replication_record"}},"created_at":"2026-05-18T01:27:45.473807+00:00","updated_at":"2026-05-18T01:27:45.473807+00:00"}