{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GLL5SSJITE4QN5GKNIVCHDYOS4","short_pith_number":"pith:GLL5SSJI","canonical_record":{"source":{"id":"1703.03712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T15:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"32c6f7471d9a94839ba3b7805ba5d20507d5dedae7a6943fb8b18fc402ea4183","abstract_canon_sha256":"33442c2668775604adfa500e224789e6f3ba2a643d4ef3f5b502787f011bf8c0"},"schema_version":"1.0"},"canonical_sha256":"32d7d94928993906f4ca6a2a238f0e972636c71268a19c3508a32e86229727b5","source":{"kind":"arxiv","id":"1703.03712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03712","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03712v1","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03712","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"GLL5SSJITE4Q","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLL5SSJITE4QN5GK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLL5SSJI","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GLL5SSJITE4QN5GKNIVCHDYOS4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.03712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T15:22:30Z","cross_cats_sorted":[],"title_canon_sha256":"32c6f7471d9a94839ba3b7805ba5d20507d5dedae7a6943fb8b18fc402ea4183","abstract_canon_sha256":"33442c2668775604adfa500e224789e6f3ba2a643d4ef3f5b502787f011bf8c0"},"schema_version":"1.0"},"canonical_sha256":"32d7d94928993906f4ca6a2a238f0e972636c71268a19c3508a32e86229727b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:35.206918Z","signature_b64":"XPGj0eI8Erc1mjxUM/HinfnaY+qs+LxE6KHFIq42FpJCYnvkmb1FQh91pTjmjZuYJ4BUoBHx/D9BdjOow1LcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d7d94928993906f4ca6a2a238f0e972636c71268a19c3508a32e86229727b5","last_reissued_at":"2026-05-18T00:21:35.206176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:35.206176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.03712","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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSPFFqVaSyt650YEyYV8UcrVaVCNmfyq1+DtC8kle9bpon4T3A/7JLUlDMKQ7n9jC5jl2/RjSx26XK14F0qTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:39:11.838487Z"},"content_sha256":"78caebcf16422e196ea466f6ed552cf06f53e44f155056031d7c130f99cff112","schema_version":"1.0","event_id":"sha256:78caebcf16422e196ea466f6ed552cf06f53e44f155056031d7c130f99cff112"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GLL5SSJITE4QN5GKNIVCHDYOS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distant sum distinguishing index of graphs","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-10T15:22:30Z","abstract_excerpt":"Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\\Delta$ and without isolated edges. The least $k$ so that 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$ is denoted by $\\chi'_{\\Sigma,r}(G)$. For $r=1$ it has been proved that $\\chi'_{\\Sigma,1}(G)=(1+o(1))\\Delta$. For any $r\\geq 2$ in turn an infinite family of graphs is known with $\\chi'_{\\Sigma,r}(G)=\\Omega(\\Delta^{r-1})$. We prove that on the other hand, $\\chi'_{\\Sigma,r}(G)=O(\\Delta^{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03712","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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FwUAMf3aNLxm4a8FcxoIoAPLxCiDGZ1eCrhVzRtzNh+T/K5JOWAZEU3oigt9xwOFhu8x2dLnFrHwjD+l3kNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T15:39:11.838834Z"},"content_sha256":"8fd80fcfec5de8834dee3d1b559da804e4d451c9cea2dbcce1f73dca89526953","schema_version":"1.0","event_id":"sha256:8fd80fcfec5de8834dee3d1b559da804e4d451c9cea2dbcce1f73dca89526953"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLL5SSJITE4QN5GKNIVCHDYOS4/bundle.json","state_url":"https://pith.science/pith/GLL5SSJITE4QN5GKNIVCHDYOS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLL5SSJITE4QN5GKNIVCHDYOS4/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-20T15:39:11Z","links":{"resolver":"https://pith.science/pith/GLL5SSJITE4QN5GKNIVCHDYOS4","bundle":"https://pith.science/pith/GLL5SSJITE4QN5GKNIVCHDYOS4/bundle.json","state":"https://pith.science/pith/GLL5SSJITE4QN5GKNIVCHDYOS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLL5SSJITE4QN5GKNIVCHDYOS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GLL5SSJITE4QN5GKNIVCHDYOS4","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":"33442c2668775604adfa500e224789e6f3ba2a643d4ef3f5b502787f011bf8c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T15:22:30Z","title_canon_sha256":"32c6f7471d9a94839ba3b7805ba5d20507d5dedae7a6943fb8b18fc402ea4183"},"schema_version":"1.0","source":{"id":"1703.03712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.03712","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1703.03712v1","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03712","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"GLL5SSJITE4Q","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLL5SSJITE4QN5GK","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLL5SSJI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:8fd80fcfec5de8834dee3d1b559da804e4d451c9cea2dbcce1f73dca89526953","target":"graph","created_at":"2026-05-18T00:21:35Z","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":"Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\\Delta$ and without isolated edges. The least $k$ so that 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$ is denoted by $\\chi'_{\\Sigma,r}(G)$. For $r=1$ it has been proved that $\\chi'_{\\Sigma,1}(G)=(1+o(1))\\Delta$. For any $r\\geq 2$ in turn an infinite family of graphs is known with $\\chi'_{\\Sigma,r}(G)=\\Omega(\\Delta^{r-1})$. We prove that on the other hand, $\\chi'_{\\Sigma,r}(G)=O(\\Delta^{","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-10T15:22:30Z","title":"Distant sum distinguishing index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03712","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:78caebcf16422e196ea466f6ed552cf06f53e44f155056031d7c130f99cff112","target":"record","created_at":"2026-05-18T00:21:35Z","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":"33442c2668775604adfa500e224789e6f3ba2a643d4ef3f5b502787f011bf8c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-10T15:22:30Z","title_canon_sha256":"32c6f7471d9a94839ba3b7805ba5d20507d5dedae7a6943fb8b18fc402ea4183"},"schema_version":"1.0","source":{"id":"1703.03712","kind":"arxiv","version":1}},"canonical_sha256":"32d7d94928993906f4ca6a2a238f0e972636c71268a19c3508a32e86229727b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32d7d94928993906f4ca6a2a238f0e972636c71268a19c3508a32e86229727b5","first_computed_at":"2026-05-18T00:21:35.206176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:35.206176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XPGj0eI8Erc1mjxUM/HinfnaY+qs+LxE6KHFIq42FpJCYnvkmb1FQh91pTjmjZuYJ4BUoBHx/D9BdjOow1LcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:35.206918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.03712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78caebcf16422e196ea466f6ed552cf06f53e44f155056031d7c130f99cff112","sha256:8fd80fcfec5de8834dee3d1b559da804e4d451c9cea2dbcce1f73dca89526953"],"state_sha256":"874e24c9c9abd2aab1b74400421a2c6eea0494fd83914f8d42075a814b665b4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LeYyniCMCkiVw7wG4/GyTd/nOkupt44CNi8yCQ5fnN6r01NPc2nL7VYHgi0Aoh6Xtr2NnN95ULrs9LOMCbMVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T15:39:11.840769Z","bundle_sha256":"78f5708931a1a015d4500e89c16db7c384f7f045181344779c07356ebac35b98"}}