{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L2BBL42IRAYINE7DPXN252P2U3","short_pith_number":"pith:L2BBL42I","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"},"canonical_sha256":"5e8215f34888308693e37ddbaee9faa6ca81a9a8b48543e95d4c91c22342386f","source":{"kind":"arxiv","id":"1508.06112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06112","created_at":"2026-05-18T00:21:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06112v1","created_at":"2026-05-18T00:21:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06112","created_at":"2026-05-18T00:21:57Z"},{"alias_kind":"pith_short_12","alias_value":"L2BBL42IRAYI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2BBL42IRAYINE7D","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2BBL42I","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L2BBL42IRAYINE7DPXN252P2U3","target":"record","payload":{"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"},"canonical_sha256":"5e8215f34888308693e37ddbaee9faa6ca81a9a8b48543e95d4c91c22342386f","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"},"source_kind":"arxiv","source_id":"1508.06112","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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vClmQRifVq/UcO2+pTGgK6QbMruNbk947wBh6hAtujjgZ1WBjczshuIsnUpDBzj/6XwVTXxhBefbd6UuqArBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:32:57.630836Z"},"content_sha256":"f44eaf3110eeb9d6f833faddd08e85d3c0cec9306d1fd6f8daf66899e8b45b0e","schema_version":"1.0","event_id":"sha256:f44eaf3110eeb9d6f833faddd08e85d3c0cec9306d1fd6f8daf66899e8b45b0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L2BBL42IRAYINE7DPXN252P2U3","target":"graph","payload":{"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"},"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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXhMxK0huxvnrrutSTpN2fkWnhCXSADJpm4efi2D0rKS+5MsFLIC9ScITx5ICbcp9BUQRI/OcvpQZTceiE64DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:32:57.631184Z"},"content_sha256":"dc4ef0e34d83aa1bd632bd86a97b2e2998201821091481fc6d0adbba30b03ffc","schema_version":"1.0","event_id":"sha256:dc4ef0e34d83aa1bd632bd86a97b2e2998201821091481fc6d0adbba30b03ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/bundle.json","state_url":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2BBL42IRAYINE7DPXN252P2U3/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-30T07:32:57Z","links":{"resolver":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3","bundle":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/bundle.json","state":"https://pith.science/pith/L2BBL42IRAYINE7DPXN252P2U3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2BBL42IRAYINE7DPXN252P2U3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L2BBL42IRAYINE7DPXN252P2U3","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":"5f6f9d623046742be7ef93b2ac426f49c71e7e5bc0024b0b181ab6d4366d6738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-25T11:27:20Z","title_canon_sha256":"f43fbbce60d5480113e2f3b64e6dfdefc4b407741480c781768539c6163c1d25"},"schema_version":"1.0","source":{"id":"1508.06112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.06112","created_at":"2026-05-18T00:21:57Z"},{"alias_kind":"arxiv_version","alias_value":"1508.06112v1","created_at":"2026-05-18T00:21:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06112","created_at":"2026-05-18T00:21:57Z"},{"alias_kind":"pith_short_12","alias_value":"L2BBL42IRAYI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L2BBL42IRAYINE7D","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L2BBL42I","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:dc4ef0e34d83aa1bd632bd86a97b2e2998201821091481fc6d0adbba30b03ffc","target":"graph","created_at":"2026-05-18T00:21:57Z","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 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","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":"2015-08-25T11:27:20Z","title":"On the 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":"1508.06112","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:f44eaf3110eeb9d6f833faddd08e85d3c0cec9306d1fd6f8daf66899e8b45b0e","target":"record","created_at":"2026-05-18T00:21:57Z","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":"5f6f9d623046742be7ef93b2ac426f49c71e7e5bc0024b0b181ab6d4366d6738","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-25T11:27:20Z","title_canon_sha256":"f43fbbce60d5480113e2f3b64e6dfdefc4b407741480c781768539c6163c1d25"},"schema_version":"1.0","source":{"id":"1508.06112","kind":"arxiv","version":1}},"canonical_sha256":"5e8215f34888308693e37ddbaee9faa6ca81a9a8b48543e95d4c91c22342386f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e8215f34888308693e37ddbaee9faa6ca81a9a8b48543e95d4c91c22342386f","first_computed_at":"2026-05-18T00:21:57.402041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:57.402041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"az+/1j8p6BB++gUGI5MFJ8k2Zp5t+tXrgAciG1eSNSV5I9GDCV7rcb9Pk8o1XB9ecO7ZaD3DC6JdNJpD3TfeAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:57.402707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.06112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f44eaf3110eeb9d6f833faddd08e85d3c0cec9306d1fd6f8daf66899e8b45b0e","sha256:dc4ef0e34d83aa1bd632bd86a97b2e2998201821091481fc6d0adbba30b03ffc"],"state_sha256":"7d67cbd283d03306b29cd812ded84185bb48e6a48e59fcf318bc2e6408546b70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuSCyxusWhKCTqcayqyZZbSwEZahhJeRXM0jGMgbltv0My4ssZ6U69in30cWoLtM8h8ZJGVYalU4rTvg/DHQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:32:57.633336Z","bundle_sha256":"3afde215ab54be45a599e4c44e531ac8b2d544dc71f3569b0a188e34703c4830"}}