{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NHGUDLH3UPJNB5ZG3ZA6IXJESF","short_pith_number":"pith:NHGUDLH3","schema_version":"1.0","canonical_sha256":"69cd41acfba3d2d0f726de41e45d249149bb28fc02bff577a00b2f801040d3db","source":{"kind":"arxiv","id":"1703.04815","version":1},"attestation_state":"computed","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\\"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.04815","created_at":"2026-05-18T00:48:39.205036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04815v1","created_at":"2026-05-18T00:48:39.205036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04815","created_at":"2026-05-18T00:48:39.205036+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHGUDLH3UPJN","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHGUDLH3UPJNB5ZG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHGUDLH3","created_at":"2026-05-18T12:31:31.346846+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/NHGUDLH3UPJNB5ZG3ZA6IXJESF","json":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF.json","graph_json":"https://pith.science/api/pith-number/NHGUDLH3UPJNB5ZG3ZA6IXJESF/graph.json","events_json":"https://pith.science/api/pith-number/NHGUDLH3UPJNB5ZG3ZA6IXJESF/events.json","paper":"https://pith.science/paper/NHGUDLH3"},"agent_actions":{"view_html":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF","download_json":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF.json","view_paper":"https://pith.science/paper/NHGUDLH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04815&json=true","fetch_graph":"https://pith.science/api/pith-number/NHGUDLH3UPJNB5ZG3ZA6IXJESF/graph.json","fetch_events":"https://pith.science/api/pith-number/NHGUDLH3UPJNB5ZG3ZA6IXJESF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/action/storage_attestation","attest_author":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/action/author_attestation","sign_citation":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/action/citation_signature","submit_replication":"https://pith.science/pith/NHGUDLH3UPJNB5ZG3ZA6IXJESF/action/replication_record"}},"created_at":"2026-05-18T00:48:39.205036+00:00","updated_at":"2026-05-18T00:48:39.205036+00:00"}