{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GEOWAHIYCECIQGRJP6MSNWETZK","short_pith_number":"pith:GEOWAHIY","canonical_record":{"source":{"id":"1703.00406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T17:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"3c0121faf10ea63881607d8abab1bfb1b0dc3c901105a2b2009b6b807aa9136b","abstract_canon_sha256":"3ae92b4a7639f39c0244dad7e1558662de080339c9e13022a1d99b6022352285"},"schema_version":"1.0"},"canonical_sha256":"311d601d181104881a297f9926d893cab839b5dc36609968257bc2d4e03b6925","source":{"kind":"arxiv","id":"1703.00406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00406","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00406v1","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00406","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"GEOWAHIYCECI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GEOWAHIYCECIQGRJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GEOWAHIY","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GEOWAHIYCECIQGRJP6MSNWETZK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T17:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"3c0121faf10ea63881607d8abab1bfb1b0dc3c901105a2b2009b6b807aa9136b","abstract_canon_sha256":"3ae92b4a7639f39c0244dad7e1558662de080339c9e13022a1d99b6022352285"},"schema_version":"1.0"},"canonical_sha256":"311d601d181104881a297f9926d893cab839b5dc36609968257bc2d4e03b6925","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:56.036647Z","signature_b64":"zKZPnDhWla0J8tKs7GQPkJNXOx71tbr97WC13yg45BISTlzXcrDQnudM73NTnicPJihtD2sg3FhCeCnWo0rZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"311d601d181104881a297f9926d893cab839b5dc36609968257bc2d4e03b6925","last_reissued_at":"2026-05-17T23:56:56.035978Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:56.035978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00406","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-17T23:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fb3uu3s7o6a7QRhwH7JmUbT4V4FO6zF8j/4+u8IIRxCeQmL+FZFHAd4lrgYG9F1sqUfpcJHrJcStwA37SvuRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:55:24.522560Z"},"content_sha256":"f2d6d71618b02bd2c467589a5c1caaab3419063eee7e2b3e91c51827ad1649af","schema_version":"1.0","event_id":"sha256:f2d6d71618b02bd2c467589a5c1caaab3419063eee7e2b3e91c51827ad1649af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GEOWAHIYCECIQGRJP6MSNWETZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on asymptotically optimal neighbour sum distinguishing colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jakub Przyby{\\l}o","submitted_at":"2017-03-01T17:37:23Z","abstract_excerpt":"The least $k$ admitting a proper edge colouring $c:E\\to\\{1,2,\\ldots,k\\}$ of a graph $G=(V,E)$ without isolated edges such that $\\sum_{e\\ni u}c(e)\\neq \\sum_{e\\ni v}c(e)$ for every $uv\\in E$ is denoted by $\\chi'_{\\Sigma}(G)$. It has been conjectured that $\\chi'_{\\Sigma}(G)\\leq \\Delta + 2$ for every connected graph of order at least three different from the cycle $C_5$, where $\\Delta$ is the maximum degree of $G$. It is known that $\\chi'_{\\Sigma}(G) = \\Delta + O(\\Delta^\\frac{5}{6}\\ln^\\frac{1}{6}\\Delta)$ for a graph $G$ without isolated edges. We improve this upper bound to $\\chi'_{\\Sigma}(G) = \\D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00406","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-17T23:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJo3kyYySZnTtspComOfEvV+YqAOYJ/vZzAPrLJiLV9DY+t99YX5uG7B8qCX0eDgVqXLxqLqt/mLRuSACqySAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:55:24.522906Z"},"content_sha256":"6ef0a0d0d43257de4faa9365ae47725e149bdba1a8e5fb2dee2f5889e0c42ead","schema_version":"1.0","event_id":"sha256:6ef0a0d0d43257de4faa9365ae47725e149bdba1a8e5fb2dee2f5889e0c42ead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEOWAHIYCECIQGRJP6MSNWETZK/bundle.json","state_url":"https://pith.science/pith/GEOWAHIYCECIQGRJP6MSNWETZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEOWAHIYCECIQGRJP6MSNWETZK/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-06-20T21:55:24Z","links":{"resolver":"https://pith.science/pith/GEOWAHIYCECIQGRJP6MSNWETZK","bundle":"https://pith.science/pith/GEOWAHIYCECIQGRJP6MSNWETZK/bundle.json","state":"https://pith.science/pith/GEOWAHIYCECIQGRJP6MSNWETZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEOWAHIYCECIQGRJP6MSNWETZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GEOWAHIYCECIQGRJP6MSNWETZK","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":"3ae92b4a7639f39c0244dad7e1558662de080339c9e13022a1d99b6022352285","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T17:37:23Z","title_canon_sha256":"3c0121faf10ea63881607d8abab1bfb1b0dc3c901105a2b2009b6b807aa9136b"},"schema_version":"1.0","source":{"id":"1703.00406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00406","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00406v1","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00406","created_at":"2026-05-17T23:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"GEOWAHIYCECI","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GEOWAHIYCECIQGRJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GEOWAHIY","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:6ef0a0d0d43257de4faa9365ae47725e149bdba1a8e5fb2dee2f5889e0c42ead","target":"graph","created_at":"2026-05-17T23:56:56Z","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":"The least $k$ admitting a proper edge colouring $c:E\\to\\{1,2,\\ldots,k\\}$ of a graph $G=(V,E)$ without isolated edges such that $\\sum_{e\\ni u}c(e)\\neq \\sum_{e\\ni v}c(e)$ for every $uv\\in E$ is denoted by $\\chi'_{\\Sigma}(G)$. It has been conjectured that $\\chi'_{\\Sigma}(G)\\leq \\Delta + 2$ for every connected graph of order at least three different from the cycle $C_5$, where $\\Delta$ is the maximum degree of $G$. It is known that $\\chi'_{\\Sigma}(G) = \\Delta + O(\\Delta^\\frac{5}{6}\\ln^\\frac{1}{6}\\Delta)$ for a graph $G$ without isolated edges. We improve this upper bound to $\\chi'_{\\Sigma}(G) = \\D","authors_text":"Jakub Przyby{\\l}o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T17:37:23Z","title":"A note on asymptotically optimal neighbour sum distinguishing colourings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00406","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:f2d6d71618b02bd2c467589a5c1caaab3419063eee7e2b3e91c51827ad1649af","target":"record","created_at":"2026-05-17T23:56:56Z","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":"3ae92b4a7639f39c0244dad7e1558662de080339c9e13022a1d99b6022352285","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T17:37:23Z","title_canon_sha256":"3c0121faf10ea63881607d8abab1bfb1b0dc3c901105a2b2009b6b807aa9136b"},"schema_version":"1.0","source":{"id":"1703.00406","kind":"arxiv","version":1}},"canonical_sha256":"311d601d181104881a297f9926d893cab839b5dc36609968257bc2d4e03b6925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"311d601d181104881a297f9926d893cab839b5dc36609968257bc2d4e03b6925","first_computed_at":"2026-05-17T23:56:56.035978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:56.035978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKZPnDhWla0J8tKs7GQPkJNXOx71tbr97WC13yg45BISTlzXcrDQnudM73NTnicPJihtD2sg3FhCeCnWo0rZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:56.036647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2d6d71618b02bd2c467589a5c1caaab3419063eee7e2b3e91c51827ad1649af","sha256:6ef0a0d0d43257de4faa9365ae47725e149bdba1a8e5fb2dee2f5889e0c42ead"],"state_sha256":"1e31b7a767231b2cb5424d8d911efa60da0a6bed8fe2384e6811b42ffb009e43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14Xkq++h8XAcUCT9slnZcocpcpghMNi6S980Igu4bkztDpECk04urU1Jk/vKATgthiOZzWEfb2KNcuLlld5CCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:55:24.524801Z","bundle_sha256":"b917795240df15c35952ff32af2512bb78179c592dbeca826993eab3262ae614"}}