{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CUHYBCNEQZX5BFYWQGKULKC2PC","short_pith_number":"pith:CUHYBCNE","schema_version":"1.0","canonical_sha256":"150f8089a4866fd09716819545a85a78ba92235aeb8a23f2a0e7fd2a330e6ba1","source":{"kind":"arxiv","id":"1803.02686","version":1},"attestation_state":"computed","paper":{"title":"On the total neighbour sum distinguishing index of graphs with bounded maximum average degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Herv\\'e Hocquard, Jakub Przyby{\\l}o","submitted_at":"2018-03-05T20:11:39Z","abstract_excerpt":"A proper total $k$-colouring of a graph $G=(V,E)$ is an assignment $c : V \\cup E\\to \\{1,2,\\ldots,k\\}$ of colours to the edges and the vertices of $G$ such that no two adjacent edges or vertices and no edge and its end-vertices are associated with the same colour. A total neighbour sum distinguishing $k$-colouring, or tnsd $k$-colouring for short, is a proper total $k$-colouring such that $\\sum_{e\\ni u}c(e)+c(u)\\neq \\sum_{e\\ni v}c(e)+c(v)$ for every edge $uv$ of $G$. We denote by $\\chi''_{\\Sigma}(G)$ the total neighbour sum distinguishing index of $G$, which is the least integer $k$ such that a"},"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":"1803.02686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T20:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"217920e511e91d02ffcef514360e6bc74d72b663ee3d539a226288153f0afa7b","abstract_canon_sha256":"cb449a7765b381ff206128fb786a20aff48db0811648f7270dfe0d6f2c622ad5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:49.501500Z","signature_b64":"61yv1bZ38kriyrv8j/C6GG4O9FjFKMpBibDft/wynUw+Tf32lVg5Vf7tCdOFqVCqX7JO0O9UohBKZG9D7tV4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"150f8089a4866fd09716819545a85a78ba92235aeb8a23f2a0e7fd2a330e6ba1","last_reissued_at":"2026-05-18T00:21:49.500857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:49.500857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the total neighbour sum distinguishing index of graphs with bounded maximum average degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Herv\\'e Hocquard, Jakub Przyby{\\l}o","submitted_at":"2018-03-05T20:11:39Z","abstract_excerpt":"A proper total $k$-colouring of a graph $G=(V,E)$ is an assignment $c : V \\cup E\\to \\{1,2,\\ldots,k\\}$ of colours to the edges and the vertices of $G$ such that no two adjacent edges or vertices and no edge and its end-vertices are associated with the same colour. A total neighbour sum distinguishing $k$-colouring, or tnsd $k$-colouring for short, is a proper total $k$-colouring such that $\\sum_{e\\ni u}c(e)+c(u)\\neq \\sum_{e\\ni v}c(e)+c(v)$ for every edge $uv$ of $G$. We denote by $\\chi''_{\\Sigma}(G)$ the total neighbour sum distinguishing index of $G$, which is the least integer $k$ such that a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02686","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":"1803.02686","created_at":"2026-05-18T00:21:49.500972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02686v1","created_at":"2026-05-18T00:21:49.500972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02686","created_at":"2026-05-18T00:21:49.500972+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUHYBCNEQZX5","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUHYBCNEQZX5BFYW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUHYBCNE","created_at":"2026-05-18T12:32:19.392346+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/CUHYBCNEQZX5BFYWQGKULKC2PC","json":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC.json","graph_json":"https://pith.science/api/pith-number/CUHYBCNEQZX5BFYWQGKULKC2PC/graph.json","events_json":"https://pith.science/api/pith-number/CUHYBCNEQZX5BFYWQGKULKC2PC/events.json","paper":"https://pith.science/paper/CUHYBCNE"},"agent_actions":{"view_html":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC","download_json":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC.json","view_paper":"https://pith.science/paper/CUHYBCNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02686&json=true","fetch_graph":"https://pith.science/api/pith-number/CUHYBCNEQZX5BFYWQGKULKC2PC/graph.json","fetch_events":"https://pith.science/api/pith-number/CUHYBCNEQZX5BFYWQGKULKC2PC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/action/storage_attestation","attest_author":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/action/author_attestation","sign_citation":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/action/citation_signature","submit_replication":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/action/replication_record"}},"created_at":"2026-05-18T00:21:49.500972+00:00","updated_at":"2026-05-18T00:21:49.500972+00:00"}