{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V62TEHEL557UA2IDOA5AZWVR56","short_pith_number":"pith:V62TEHEL","canonical_record":{"source":{"id":"1703.02787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T11:05:35Z","cross_cats_sorted":[],"title_canon_sha256":"faa5f8361836adc2ecf4ee56065351df0841c6545e643273e501e1a6dbaf6558","abstract_canon_sha256":"6ad6f1ed84796dcb2f20df05418618c7a2a363638e3953a212737d9b4ca1f413"},"schema_version":"1.0"},"canonical_sha256":"afb5321c8bef7f406903703a0cdab1efb2bac7deb62c86d1ffc732e1560a49ab","source":{"kind":"arxiv","id":"1703.02787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02787","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02787v1","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02787","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"V62TEHEL557U","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V62TEHEL557UA2ID","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V62TEHEL","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V62TEHEL557UA2IDOA5AZWVR56","target":"record","payload":{"canonical_record":{"source":{"id":"1703.02787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T11:05:35Z","cross_cats_sorted":[],"title_canon_sha256":"faa5f8361836adc2ecf4ee56065351df0841c6545e643273e501e1a6dbaf6558","abstract_canon_sha256":"6ad6f1ed84796dcb2f20df05418618c7a2a363638e3953a212737d9b4ca1f413"},"schema_version":"1.0"},"canonical_sha256":"afb5321c8bef7f406903703a0cdab1efb2bac7deb62c86d1ffc732e1560a49ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:35.233774Z","signature_b64":"4ExjC7QtGvPhbkc+6aTn/XRBHUAKW6MD6157oghEXCNH+/A+g87JQmS5TfwM23oAd+gll9qfT/WvaWhByWZABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afb5321c8bef7f406903703a0cdab1efb2bac7deb62c86d1ffc732e1560a49ab","last_reissued_at":"2026-05-18T00:21:35.233030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:35.233030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.02787","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":"9+N+Q+SJU6zd7wNBE2zqV9viQGk1Pdhu8HNofTcEPraZ+Ij4XAttJIBnwYZNtUwrF+q9i11gSopfCGJAIXhdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:54:39.317334Z"},"content_sha256":"61bfb6dbfc2e1c8bd21b670fa696c26a3c6f81cbf685bf3c771cc0c2f71e677a","schema_version":"1.0","event_id":"sha256:61bfb6dbfc2e1c8bd21b670fa696c26a3c6f81cbf685bf3c771cc0c2f71e677a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V62TEHEL557UA2IDOA5AZWVR56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distant irregularity strength 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-08T11:05:35Z","abstract_excerpt":"Consider a graph $G=(V,E)$ without isolated edges and with maximum degree $\\Delta$. Given a colouring $c:E\\to\\{1,2,\\ldots,k\\}$, the weighted degree of a vertex $v\\in V$ is the sum of its incident colours, i.e., $\\sum_{e\\ni v}c(e)$. For any integer $r\\geq 2$, the least $k$ admitting the existence of such $c$ attributing distinct weighted degrees to any two different vertices at distance at most $r$ in $G$ is called the $r$-distant irregularity strength of $G$ and denoted by $s_r(G)$. This graph invariant provides a natural link between the well known 1--2--3 Conjecture and irregularity strength"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02787","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":"zShLDO4hJo72qcmP4Es9LJIlOxJgORAkW8CVrKY5qrAOXILYPFcXYT4f1uC02Gu7/DbxE4e33qUtDWPOQDGcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:54:39.317692Z"},"content_sha256":"3440d10f69e4e1f6b35e9aa512c80abdbe4738f6dc42d5fbaae10a1bb5a6a32c","schema_version":"1.0","event_id":"sha256:3440d10f69e4e1f6b35e9aa512c80abdbe4738f6dc42d5fbaae10a1bb5a6a32c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V62TEHEL557UA2IDOA5AZWVR56/bundle.json","state_url":"https://pith.science/pith/V62TEHEL557UA2IDOA5AZWVR56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V62TEHEL557UA2IDOA5AZWVR56/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:54:39Z","links":{"resolver":"https://pith.science/pith/V62TEHEL557UA2IDOA5AZWVR56","bundle":"https://pith.science/pith/V62TEHEL557UA2IDOA5AZWVR56/bundle.json","state":"https://pith.science/pith/V62TEHEL557UA2IDOA5AZWVR56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V62TEHEL557UA2IDOA5AZWVR56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V62TEHEL557UA2IDOA5AZWVR56","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":"6ad6f1ed84796dcb2f20df05418618c7a2a363638e3953a212737d9b4ca1f413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T11:05:35Z","title_canon_sha256":"faa5f8361836adc2ecf4ee56065351df0841c6545e643273e501e1a6dbaf6558"},"schema_version":"1.0","source":{"id":"1703.02787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.02787","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"arxiv_version","alias_value":"1703.02787v1","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.02787","created_at":"2026-05-18T00:21:35Z"},{"alias_kind":"pith_short_12","alias_value":"V62TEHEL557U","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V62TEHEL557UA2ID","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V62TEHEL","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:3440d10f69e4e1f6b35e9aa512c80abdbe4738f6dc42d5fbaae10a1bb5a6a32c","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 graph $G=(V,E)$ without isolated edges and with maximum degree $\\Delta$. Given a colouring $c:E\\to\\{1,2,\\ldots,k\\}$, the weighted degree of a vertex $v\\in V$ is the sum of its incident colours, i.e., $\\sum_{e\\ni v}c(e)$. For any integer $r\\geq 2$, the least $k$ admitting the existence of such $c$ attributing distinct weighted degrees to any two different vertices at distance at most $r$ in $G$ is called the $r$-distant irregularity strength of $G$ and denoted by $s_r(G)$. This graph invariant provides a natural link between the well known 1--2--3 Conjecture and irregularity strength","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-08T11:05:35Z","title":"Distant irregularity strength of graphs with bounded minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.02787","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:61bfb6dbfc2e1c8bd21b670fa696c26a3c6f81cbf685bf3c771cc0c2f71e677a","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":"6ad6f1ed84796dcb2f20df05418618c7a2a363638e3953a212737d9b4ca1f413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-08T11:05:35Z","title_canon_sha256":"faa5f8361836adc2ecf4ee56065351df0841c6545e643273e501e1a6dbaf6558"},"schema_version":"1.0","source":{"id":"1703.02787","kind":"arxiv","version":1}},"canonical_sha256":"afb5321c8bef7f406903703a0cdab1efb2bac7deb62c86d1ffc732e1560a49ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"afb5321c8bef7f406903703a0cdab1efb2bac7deb62c86d1ffc732e1560a49ab","first_computed_at":"2026-05-18T00:21:35.233030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:35.233030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ExjC7QtGvPhbkc+6aTn/XRBHUAKW6MD6157oghEXCNH+/A+g87JQmS5TfwM23oAd+gll9qfT/WvaWhByWZABw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:35.233774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.02787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61bfb6dbfc2e1c8bd21b670fa696c26a3c6f81cbf685bf3c771cc0c2f71e677a","sha256:3440d10f69e4e1f6b35e9aa512c80abdbe4738f6dc42d5fbaae10a1bb5a6a32c"],"state_sha256":"ca0fedc901db441f029cd4d1306c0f6aada10fac7cfa8052463758353dc10fb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CeKkghcxFrdQ5afEZ43NpKSVDR7SOqbIVU+k9FhNUafq9WwiNorcJ53T9NGB49ilwWUKKx9xxDn4E119IsCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:54:39.319926Z","bundle_sha256":"4b07da760903ebcd13ff21c05b3169ae1d59ab2e3175680b182a6d53ef68f115"}}