{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CUHYBCNEQZX5BFYWQGKULKC2PC","short_pith_number":"pith:CUHYBCNE","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"},"canonical_sha256":"150f8089a4866fd09716819545a85a78ba92235aeb8a23f2a0e7fd2a330e6ba1","source":{"kind":"arxiv","id":"1803.02686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02686","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02686v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02686","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"CUHYBCNEQZX5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CUHYBCNEQZX5BFYW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CUHYBCNE","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CUHYBCNEQZX5BFYWQGKULKC2PC","target":"record","payload":{"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"},"canonical_sha256":"150f8089a4866fd09716819545a85a78ba92235aeb8a23f2a0e7fd2a330e6ba1","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"},"source_kind":"arxiv","source_id":"1803.02686","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BYrRGcm6X4UVxBJtZow1+X0Dm5BTkg/c4I/n9cKBOVJV5yCVWn+0Fdeq2FalWLiDFoae5s57W+I78ug27MovDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:39.955469Z"},"content_sha256":"07d57f786e02ca47285d2537879882bcd11c3d84f7668ffb133d8ee56ada3be4","schema_version":"1.0","event_id":"sha256:07d57f786e02ca47285d2537879882bcd11c3d84f7668ffb133d8ee56ada3be4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CUHYBCNEQZX5BFYWQGKULKC2PC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:21:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4IeNnKoniEzyxjjcJpxXbANY220Lz61ClwnlDXr5FUz4QI8J5MDWY4NEPj8QiCPBTqPqnt48Gqx7KrQv5gUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:39.955822Z"},"content_sha256":"4887ee0547a7cac701b7855790b897bdded057de0792ef31adbf2213b8cc0030","schema_version":"1.0","event_id":"sha256:4887ee0547a7cac701b7855790b897bdded057de0792ef31adbf2213b8cc0030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/bundle.json","state_url":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T12:05:39Z","links":{"resolver":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC","bundle":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/bundle.json","state":"https://pith.science/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUHYBCNEQZX5BFYWQGKULKC2PC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CUHYBCNEQZX5BFYWQGKULKC2PC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cb449a7765b381ff206128fb786a20aff48db0811648f7270dfe0d6f2c622ad5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T20:11:39Z","title_canon_sha256":"217920e511e91d02ffcef514360e6bc74d72b663ee3d539a226288153f0afa7b"},"schema_version":"1.0","source":{"id":"1803.02686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.02686","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.02686v1","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02686","created_at":"2026-05-18T00:21:49Z"},{"alias_kind":"pith_short_12","alias_value":"CUHYBCNEQZX5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CUHYBCNEQZX5BFYW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CUHYBCNE","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:4887ee0547a7cac701b7855790b897bdded057de0792ef31adbf2213b8cc0030","target":"graph","created_at":"2026-05-18T00:21:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Herv\\'e Hocquard, Jakub Przyby{\\l}o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T20:11:39Z","title":"On the total neighbour sum distinguishing index of graphs with bounded maximum average degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02686","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07d57f786e02ca47285d2537879882bcd11c3d84f7668ffb133d8ee56ada3be4","target":"record","created_at":"2026-05-18T00:21:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cb449a7765b381ff206128fb786a20aff48db0811648f7270dfe0d6f2c622ad5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-05T20:11:39Z","title_canon_sha256":"217920e511e91d02ffcef514360e6bc74d72b663ee3d539a226288153f0afa7b"},"schema_version":"1.0","source":{"id":"1803.02686","kind":"arxiv","version":1}},"canonical_sha256":"150f8089a4866fd09716819545a85a78ba92235aeb8a23f2a0e7fd2a330e6ba1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"150f8089a4866fd09716819545a85a78ba92235aeb8a23f2a0e7fd2a330e6ba1","first_computed_at":"2026-05-18T00:21:49.500857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:49.500857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"61yv1bZ38kriyrv8j/C6GG4O9FjFKMpBibDft/wynUw+Tf32lVg5Vf7tCdOFqVCqX7JO0O9UohBKZG9D7tV4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:49.501500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.02686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07d57f786e02ca47285d2537879882bcd11c3d84f7668ffb133d8ee56ada3be4","sha256:4887ee0547a7cac701b7855790b897bdded057de0792ef31adbf2213b8cc0030"],"state_sha256":"52b14e198768d065b3f0928364d3ba48c858b03a5c2e19413f6711e309d8f7bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hx/d+5K066qxUz5G0uF18l0aBcC5Ou3SnVCxn0EP1ppLjvzMZXXrccD6Yst5MPBAZsfZGfmG7FCNSaBPMG37Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:39.957977Z","bundle_sha256":"973a40880a14a84b5f6287a8f1dafaf3050d600e474142ccc67ccf1275ce549b"}}