{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PI3TKPYRDNUSBKUDBRZEJVS2X5","short_pith_number":"pith:PI3TKPYR","schema_version":"1.0","canonical_sha256":"7a37353f111b6920aa830c7244d65abf73f58400939f83a2e230529b60110e13","source":{"kind":"arxiv","id":"1105.1906","version":1},"attestation_state":"computed","paper":{"title":"List version of ($p$,1)-total labellings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Guizhen Liu, Yong Yu","submitted_at":"2011-05-10T11:01:14Z","abstract_excerpt":"The ($p$,1)-total number $\\lambda_p^T(G)$ of a graph $G$ is the width of the smallest range of integers that suffices to label the vertices and the edges of $G$ such that no two adjacent vertices have the same label, no two incident edges have the same label and the difference between the labels of a vertex and its incident edges is at least $p$. In this paper we consider the list version. Let $L(x)$ be a list of possible colors for all $x\\in V(G)\\cup E(G)$. Define $C_{p,1}^T(G)$ to be the smallest integer $k$ such that for every list assignment with $|L(x)|=k$ for all $x\\in V(G)\\cup E(G)$, $G"},"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":"1105.1906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-10T11:01:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"13b2f1ed33440d511f9aadc092487f4ed9ad013cd623a5861e66a45403a7abb2","abstract_canon_sha256":"510aba492988636729d60474240a9cd0ea3d4904aaf03de06aef91c57c4df0a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:30.323562Z","signature_b64":"C3VJLxMlmI2vuBO9lgbehhJHO7STzD26vYIk1L83nFPL5aQJobNnSaDaCj7k7SjEqQ762IzK7SdEGM7orKnkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a37353f111b6920aa830c7244d65abf73f58400939f83a2e230529b60110e13","last_reissued_at":"2026-05-18T04:22:30.323104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:30.323104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List version of ($p$,1)-total labellings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Guizhen Liu, Yong Yu","submitted_at":"2011-05-10T11:01:14Z","abstract_excerpt":"The ($p$,1)-total number $\\lambda_p^T(G)$ of a graph $G$ is the width of the smallest range of integers that suffices to label the vertices and the edges of $G$ such that no two adjacent vertices have the same label, no two incident edges have the same label and the difference between the labels of a vertex and its incident edges is at least $p$. In this paper we consider the list version. Let $L(x)$ be a list of possible colors for all $x\\in V(G)\\cup E(G)$. Define $C_{p,1}^T(G)$ to be the smallest integer $k$ such that for every list assignment with $|L(x)|=k$ for all $x\\in V(G)\\cup E(G)$, $G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1906","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":"1105.1906","created_at":"2026-05-18T04:22:30.323182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1906v1","created_at":"2026-05-18T04:22:30.323182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1906","created_at":"2026-05-18T04:22:30.323182+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI3TKPYRDNUS","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI3TKPYRDNUSBKUD","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI3TKPYR","created_at":"2026-05-18T12:26:39.201973+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/PI3TKPYRDNUSBKUDBRZEJVS2X5","json":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5.json","graph_json":"https://pith.science/api/pith-number/PI3TKPYRDNUSBKUDBRZEJVS2X5/graph.json","events_json":"https://pith.science/api/pith-number/PI3TKPYRDNUSBKUDBRZEJVS2X5/events.json","paper":"https://pith.science/paper/PI3TKPYR"},"agent_actions":{"view_html":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5","download_json":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5.json","view_paper":"https://pith.science/paper/PI3TKPYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1906&json=true","fetch_graph":"https://pith.science/api/pith-number/PI3TKPYRDNUSBKUDBRZEJVS2X5/graph.json","fetch_events":"https://pith.science/api/pith-number/PI3TKPYRDNUSBKUDBRZEJVS2X5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5/action/storage_attestation","attest_author":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5/action/author_attestation","sign_citation":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5/action/citation_signature","submit_replication":"https://pith.science/pith/PI3TKPYRDNUSBKUDBRZEJVS2X5/action/replication_record"}},"created_at":"2026-05-18T04:22:30.323182+00:00","updated_at":"2026-05-18T04:22:30.323182+00:00"}