{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:56AFQWCYL6HYDKUTM4HXY4VYFD","short_pith_number":"pith:56AFQWCY","schema_version":"1.0","canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","source":{"kind":"arxiv","id":"1507.07573","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically optimal neighbor sum distinguishing total colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o, Sarah Loeb, Yunfang Tang","submitted_at":"2015-07-27T20:17:17Z","abstract_excerpt":"Given a proper total $k$-coloring $c:V(G)\\cup E(G)\\to\\{1,2,\\ldots,k\\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \\sum_{uv \\in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose values form a proper coloring is the neighbor sum distinguishing total chromatic number of $G$, $\\chi\"_{\\Sigma}(G)$. Pil\\'sniak and Wo\\'zniak (2013) conjectured that $\\chi\"_{\\Sigma}(G)\\leq \\Delta(G)+3$ for any simple graph with maximum degree $\\Delta(G)$. In this paper, we prove this bound to be asymptotically correct by showing that $\\chi\"_{\\Sigma}(G)\\leq "},"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":"1507.07573","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T20:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"9ab63a6d350e681cf1eedd2024bea8759a1886f399ed45f640ffb050d14b44f2","abstract_canon_sha256":"d5d97337d73ba055458b0e9a5cad429af62a12af886242d42515f9399250fa72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:46.242142Z","signature_b64":"CL3b+0bNZghAw1KXTViPFpRgE3sL5BY4Rtt2MNyKcTMVNKlBkL4IRqsj8iDWE4a06UHWSBViTqb98u5sQiOcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef805858585f8f81aa93670f7c72b828e190b277094cea1c6cce94bbebcd643c","last_reissued_at":"2026-05-18T01:09:46.241494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:46.241494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically optimal neighbor sum distinguishing total colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o, Sarah Loeb, Yunfang Tang","submitted_at":"2015-07-27T20:17:17Z","abstract_excerpt":"Given a proper total $k$-coloring $c:V(G)\\cup E(G)\\to\\{1,2,\\ldots,k\\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \\sum_{uv \\in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose values form a proper coloring is the neighbor sum distinguishing total chromatic number of $G$, $\\chi\"_{\\Sigma}(G)$. Pil\\'sniak and Wo\\'zniak (2013) conjectured that $\\chi\"_{\\Sigma}(G)\\leq \\Delta(G)+3$ for any simple graph with maximum degree $\\Delta(G)$. In this paper, we prove this bound to be asymptotically correct by showing that $\\chi\"_{\\Sigma}(G)\\leq "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07573","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":"1507.07573","created_at":"2026-05-18T01:09:46.241608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07573v2","created_at":"2026-05-18T01:09:46.241608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07573","created_at":"2026-05-18T01:09:46.241608+00:00"},{"alias_kind":"pith_short_12","alias_value":"56AFQWCYL6HY","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"56AFQWCYL6HYDKUT","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"56AFQWCY","created_at":"2026-05-18T12:29:05.191682+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/56AFQWCYL6HYDKUTM4HXY4VYFD","json":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD.json","graph_json":"https://pith.science/api/pith-number/56AFQWCYL6HYDKUTM4HXY4VYFD/graph.json","events_json":"https://pith.science/api/pith-number/56AFQWCYL6HYDKUTM4HXY4VYFD/events.json","paper":"https://pith.science/paper/56AFQWCY"},"agent_actions":{"view_html":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD","download_json":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD.json","view_paper":"https://pith.science/paper/56AFQWCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07573&json=true","fetch_graph":"https://pith.science/api/pith-number/56AFQWCYL6HYDKUTM4HXY4VYFD/graph.json","fetch_events":"https://pith.science/api/pith-number/56AFQWCYL6HYDKUTM4HXY4VYFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/action/storage_attestation","attest_author":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/action/author_attestation","sign_citation":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/action/citation_signature","submit_replication":"https://pith.science/pith/56AFQWCYL6HYDKUTM4HXY4VYFD/action/replication_record"}},"created_at":"2026-05-18T01:09:46.241608+00:00","updated_at":"2026-05-18T01:09:46.241608+00:00"}