{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L2BBL42IRAYINE7DPXN252P2U3","short_pith_number":"pith:L2BBL42I","schema_version":"1.0","canonical_sha256":"5e8215f34888308693e37ddbaee9faa6ca81a9a8b48543e95d4c91c22342386f","source":{"kind":"arxiv","id":"1508.06112","version":1},"attestation_state":"computed","paper":{"title":"On the 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":"2015-08-25T11:27:20Z","abstract_excerpt":"A proper edge $k$-colouring of a graph $G=(V,E)$ is an assignment $c:E\\to \\{1,2,\\ldots,k\\}$ of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A neighbour sum distinguishing edge $k$-colouring, or nsd $k$-colouring for short, is a proper edge $k$-colouring such that $\\sum_{e\\ni u}c(e)\\neq \\sum_{e\\ni v}c(e)$ for every edge $uv$ of $G$. We denote by $\\chi'_{\\sum}(G)$ the neighbour sum distinguishing index of $G$, which is the least integer $k$ such that an nsd $k$-colouring of $G$ exists. By definition at least maximum degree, $\\Delta(G)$ co"},"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":"1508.06112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-25T11:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"f43fbbce60d5480113e2f3b64e6dfdefc4b407741480c781768539c6163c1d25","abstract_canon_sha256":"5f6f9d623046742be7ef93b2ac426f49c71e7e5bc0024b0b181ab6d4366d6738"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:57.402707Z","signature_b64":"az+/1j8p6BB++gUGI5MFJ8k2Zp5t+tXrgAciG1eSNSV5I9GDCV7rcb9Pk8o1XB9ecO7ZaD3DC6JdNJpD3TfeAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e8215f34888308693e37ddbaee9faa6ca81a9a8b48543e95d4c91c22342386f","last_reissued_at":"2026-05-18T00:21:57.402041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:57.402041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the 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":"2015-08-25T11:27:20Z","abstract_excerpt":"A proper edge $k$-colouring of a graph $G=(V,E)$ is an assignment $c:E\\to \\{1,2,\\ldots,k\\}$ of colours to the edges of the graph such that no two adjacent edges are associated with the same colour. A neighbour sum distinguishing edge $k$-colouring, or nsd $k$-colouring for short, is a proper edge $k$-colouring such that $\\sum_{e\\ni u}c(e)\\neq \\sum_{e\\ni v}c(e)$ for every edge $uv$ of $G$. We denote by $\\chi'_{\\sum}(G)$ the neighbour sum distinguishing index of $G$, which is the least integer $k$ such that an nsd $k$-colouring of $G$ exists. By definition at least maximum degree, $\\Delta(G)$ co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06112","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":"1508.06112","created_at":"2026-05-18T00:21:57.402137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06112v1","created_at":"2026-05-18T00:21:57.402137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06112","created_at":"2026-05-18T00:21:57.402137+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2BBL42IRAYI","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2BBL42IRAYINE7D","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2BBL42I","created_at":"2026-05-18T12:29:29.992203+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/L2BBL42IRAYINE7DPXN252P2U3","json":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3.json","graph_json":"https://pith.science/api/pith-number/L2BBL42IRAYINE7DPXN252P2U3/graph.json","events_json":"https://pith.science/api/pith-number/L2BBL42IRAYINE7DPXN252P2U3/events.json","paper":"https://pith.science/paper/L2BBL42I"},"agent_actions":{"view_html":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3","download_json":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3.json","view_paper":"https://pith.science/paper/L2BBL42I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06112&json=true","fetch_graph":"https://pith.science/api/pith-number/L2BBL42IRAYINE7DPXN252P2U3/graph.json","fetch_events":"https://pith.science/api/pith-number/L2BBL42IRAYINE7DPXN252P2U3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/action/storage_attestation","attest_author":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/action/author_attestation","sign_citation":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/action/citation_signature","submit_replication":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/action/replication_record"}},"created_at":"2026-05-18T00:21:57.402137+00:00","updated_at":"2026-05-18T00:21:57.402137+00:00"}