{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7XXO625XY4KHDELL7FMFYGZKQK","short_pith_number":"pith:7XXO625X","schema_version":"1.0","canonical_sha256":"fdeeef6bb7c71471916bf9585c1b2a82875479c4a7d42d5f4f662ec91f0e5986","source":{"kind":"arxiv","id":"1703.00376","version":1},"attestation_state":"computed","paper":{"title":"Distant total irregularity strength of graphs via random vertex ordering","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-01T16:46:28Z","abstract_excerpt":"Let $c:V\\cup E\\to\\{1,2,\\ldots,k\\}$ be a (not necessarily proper) total colouring of a graph $G=(V,E)$ with maximum degree $\\Delta$. Two vertices $u,v\\in V$ are sum distinguished if they differ with respect to sums of their incident colours, i.e. $c(u)+\\sum_{e\\ni u}c(e)\\neq c(v)+\\sum_{e\\ni v}c(e)$. The least integer $k$ admitting such colouring $c$ under which every $u,v\\in V$ at distance $1\\leq d(u,v)\\leq r$ in $G$ are sum distinguished is denoted by ${\\rm ts}_r(G)$. Such graph invariants link the concept of the total vertex irregularity strength of graphs with so called 1-2-Conjecture, whose "},"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.00376","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-01T16:46:28Z","cross_cats_sorted":[],"title_canon_sha256":"9275d249e8aad293b5439686e89f186ebc24c1caf304acf7480a4810d9ee24ea","abstract_canon_sha256":"4b68032058794f9ec57e16749d0e22a83da9cca42b37326f2ec4afc05121ae56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:35.250601Z","signature_b64":"ElHHVPnSJv1QrCGLizggaVGqu1uVg7ASKSjStlzxqwzEWPcT8XEqhlQLbJxvEqaxU+eXGf7RYhJ+SHmfQmmsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdeeef6bb7c71471916bf9585c1b2a82875479c4a7d42d5f4f662ec91f0e5986","last_reissued_at":"2026-05-18T00:21:35.250014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:35.250014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distant total irregularity strength of graphs via random vertex ordering","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-01T16:46:28Z","abstract_excerpt":"Let $c:V\\cup E\\to\\{1,2,\\ldots,k\\}$ be a (not necessarily proper) total colouring of a graph $G=(V,E)$ with maximum degree $\\Delta$. Two vertices $u,v\\in V$ are sum distinguished if they differ with respect to sums of their incident colours, i.e. $c(u)+\\sum_{e\\ni u}c(e)\\neq c(v)+\\sum_{e\\ni v}c(e)$. The least integer $k$ admitting such colouring $c$ under which every $u,v\\in V$ at distance $1\\leq d(u,v)\\leq r$ in $G$ are sum distinguished is denoted by ${\\rm ts}_r(G)$. Such graph invariants link the concept of the total vertex irregularity strength of graphs with so called 1-2-Conjecture, whose "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00376","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.00376","created_at":"2026-05-18T00:21:35.250113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00376v1","created_at":"2026-05-18T00:21:35.250113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00376","created_at":"2026-05-18T00:21:35.250113+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XXO625XY4KH","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XXO625XY4KHDELL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XXO625X","created_at":"2026-05-18T12:31:05.417338+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/7XXO625XY4KHDELL7FMFYGZKQK","json":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK.json","graph_json":"https://pith.science/api/pith-number/7XXO625XY4KHDELL7FMFYGZKQK/graph.json","events_json":"https://pith.science/api/pith-number/7XXO625XY4KHDELL7FMFYGZKQK/events.json","paper":"https://pith.science/paper/7XXO625X"},"agent_actions":{"view_html":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK","download_json":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK.json","view_paper":"https://pith.science/paper/7XXO625X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00376&json=true","fetch_graph":"https://pith.science/api/pith-number/7XXO625XY4KHDELL7FMFYGZKQK/graph.json","fetch_events":"https://pith.science/api/pith-number/7XXO625XY4KHDELL7FMFYGZKQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK/action/storage_attestation","attest_author":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK/action/author_attestation","sign_citation":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK/action/citation_signature","submit_replication":"https://pith.science/pith/7XXO625XY4KHDELL7FMFYGZKQK/action/replication_record"}},"created_at":"2026-05-18T00:21:35.250113+00:00","updated_at":"2026-05-18T00:21:35.250113+00:00"}