{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NHGUDLH3UPJNB5ZG3ZA6IXJESF","short_pith_number":"pith:NHGUDLH3","canonical_record":{"source":{"id":"1703.04815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-14T23:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"7638ad465640c2b14e73c9806bae800fed4409c1bdc458920ab9fa8dfc85894a","abstract_canon_sha256":"6c83964a39995e75db0e07cc19c2390d09a17283549d8ea568ea720a526c40c4"},"schema_version":"1.0"},"canonical_sha256":"69cd41acfba3d2d0f726de41e45d249149bb28fc02bff577a00b2f801040d3db","source":{"kind":"arxiv","id":"1703.04815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04815","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04815v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04815","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"NHGUDLH3UPJN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHGUDLH3UPJNB5ZG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHGUDLH3","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NHGUDLH3UPJNB5ZG3ZA6IXJESF","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-14T23:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"7638ad465640c2b14e73c9806bae800fed4409c1bdc458920ab9fa8dfc85894a","abstract_canon_sha256":"6c83964a39995e75db0e07cc19c2390d09a17283549d8ea568ea720a526c40c4"},"schema_version":"1.0"},"canonical_sha256":"69cd41acfba3d2d0f726de41e45d249149bb28fc02bff577a00b2f801040d3db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:39.205396Z","signature_b64":"0MpS09LRhUzLT0cMpFujDqEwjLK07eSFgGoSSx90QE1C7SvPau3vy4hgnSyXsqbbkl7ygcf/hmIGtFog1CKrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69cd41acfba3d2d0f726de41e45d249149bb28fc02bff577a00b2f801040d3db","last_reissued_at":"2026-05-18T00:48:39.204969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:39.204969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04815","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6I/R64wD343njsVbj5JxxzE3MRoNb/w/Mx2tVUa6yKR7jWCXxtpx7ck3631+saB2L/qT/YmZbvHO+/w7S255Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:41.684569Z"},"content_sha256":"e84fcb286239cbee687eb4e50386ba89640b1f2f722a9d9ffcc253c5da8e5494","schema_version":"1.0","event_id":"sha256:e84fcb286239cbee687eb4e50386ba89640b1f2f722a9d9ffcc253c5da8e5494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NHGUDLH3UPJNB5ZG3ZA6IXJESF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distant sum distinguishing index of graphs with bounded minimum degree","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-14T23:06:57Z","abstract_excerpt":"For any graph $G=(V,E)$ with maximum degree $\\Delta$ and without isolated edges, and a positive integer $r$, by $\\chi'_{\\Sigma,r}(G)$ we denote the $r$-distant sum distinguishing index of $G$. This is the least integer $k$ for which a proper edge colouring $c:E\\to\\{1,2,\\ldots,k\\}$ exists such that $\\sum_{e\\ni u}c(e)\\neq \\sum_{e\\ni v}c(e)$ for every pair of distinct vertices $u,v$ at distance at most $r$ in $G$. It was conjectured that $\\chi'_{\\Sigma,r}(G)\\leq (1+o(1))\\Delta^{r-1}$ for every $r\\geq 3$. Thus far it has been in particular proved that $\\chi'_{\\Sigma,r}(G)\\leq 6\\Delta^{r-1}$ if $r\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04815","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:48:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f85lqFMosyc9ibyPWoe6p3c/T/LNSpLPUemoiQ8jBnZiJwatN7lwAzxc8k9YSozMKPOFW5y928PPbfDoZSHqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:05:41.684946Z"},"content_sha256":"db680219df3e4c8e2c2229a1bb2711107cddee6487fa82b9a03a7297ef190d72","schema_version":"1.0","event_id":"sha256:db680219df3e4c8e2c2229a1bb2711107cddee6487fa82b9a03a7297ef190d72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/bundle.json","state_url":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/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:41Z","links":{"resolver":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF","bundle":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/bundle.json","state":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NHGUDLH3UPJNB5ZG3ZA6IXJESF","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":"6c83964a39995e75db0e07cc19c2390d09a17283549d8ea568ea720a526c40c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-14T23:06:57Z","title_canon_sha256":"7638ad465640c2b14e73c9806bae800fed4409c1bdc458920ab9fa8dfc85894a"},"schema_version":"1.0","source":{"id":"1703.04815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04815","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04815v1","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04815","created_at":"2026-05-18T00:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"NHGUDLH3UPJN","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NHGUDLH3UPJNB5ZG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NHGUDLH3","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:db680219df3e4c8e2c2229a1bb2711107cddee6487fa82b9a03a7297ef190d72","target":"graph","created_at":"2026-05-18T00:48:39Z","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":"For any graph $G=(V,E)$ with maximum degree $\\Delta$ and without isolated edges, and a positive integer $r$, by $\\chi'_{\\Sigma,r}(G)$ we denote the $r$-distant sum distinguishing index of $G$. This is the least integer $k$ for which a proper edge colouring $c:E\\to\\{1,2,\\ldots,k\\}$ exists such that $\\sum_{e\\ni u}c(e)\\neq \\sum_{e\\ni v}c(e)$ for every pair of distinct vertices $u,v$ at distance at most $r$ in $G$. It was conjectured that $\\chi'_{\\Sigma,r}(G)\\leq (1+o(1))\\Delta^{r-1}$ for every $r\\geq 3$. Thus far it has been in particular proved that $\\chi'_{\\Sigma,r}(G)\\leq 6\\Delta^{r-1}$ if $r\\","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-14T23:06:57Z","title":"Distant sum distinguishing index of graphs with bounded minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04815","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:e84fcb286239cbee687eb4e50386ba89640b1f2f722a9d9ffcc253c5da8e5494","target":"record","created_at":"2026-05-18T00:48:39Z","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":"6c83964a39995e75db0e07cc19c2390d09a17283549d8ea568ea720a526c40c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-14T23:06:57Z","title_canon_sha256":"7638ad465640c2b14e73c9806bae800fed4409c1bdc458920ab9fa8dfc85894a"},"schema_version":"1.0","source":{"id":"1703.04815","kind":"arxiv","version":1}},"canonical_sha256":"69cd41acfba3d2d0f726de41e45d249149bb28fc02bff577a00b2f801040d3db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69cd41acfba3d2d0f726de41e45d249149bb28fc02bff577a00b2f801040d3db","first_computed_at":"2026-05-18T00:48:39.204969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:39.204969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MpS09LRhUzLT0cMpFujDqEwjLK07eSFgGoSSx90QE1C7SvPau3vy4hgnSyXsqbbkl7ygcf/hmIGtFog1CKrBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:39.205396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e84fcb286239cbee687eb4e50386ba89640b1f2f722a9d9ffcc253c5da8e5494","sha256:db680219df3e4c8e2c2229a1bb2711107cddee6487fa82b9a03a7297ef190d72"],"state_sha256":"ea834f438202da8acb15cb1a5b9c160f55a28248ed735503d35e8b544d85184b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7fug3SA0/r3nQR+3FdTGXHoGNBlfr2TPE7xIWW45bpPPbWYwAMIEW65yS3IiA4jn4bLK7ouwM0hmN1/+zTKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:05:41.687793Z","bundle_sha256":"da2596886332db49e4b0a3cd0c043485743a6b535753f01f5b68597d8681ca26"}}