{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RFXWBEGQBM55DUBTNQIXTNOAHZ","short_pith_number":"pith:RFXWBEGQ","schema_version":"1.0","canonical_sha256":"896f6090d00b3bd1d0336c1179b5c03e6ebcb5d3948edbce8e1e619372ae17da","source":{"kind":"arxiv","id":"1105.1908","version":1},"attestation_state":"computed","paper":{"title":"(2,1)-Total labeling of planar graphs with large maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Jinbo Li, Xin Zhang, Yong Yu","submitted_at":"2011-05-10T11:01:50Z","abstract_excerpt":"The ($d$,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph $G$ with maximum degree $\\Delta\\geq12$ and $d=2$, the (2,1)-total labelling number $\\lambda_2^T(G)$ is at most $\\Delta+2$."},"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.1908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-10T11:01:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0b5d1de9c519e67499fff9036a9fe9dc860061c8d67fa3c39244ef40d1ba56ff","abstract_canon_sha256":"e6d73299e363735114e640e140c8c19e5849ca800c4357f51a904517ff0e9059"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:30.317062Z","signature_b64":"eEA1Shb6fvVyRY71S8SstWM3xuIlnAIURSXYU62KbUaAtnnFYhz4DIf7DBs4lZUzjwSY696XbZgujx0KFR5/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"896f6090d00b3bd1d0336c1179b5c03e6ebcb5d3948edbce8e1e619372ae17da","last_reissued_at":"2026-05-18T04:22:30.316601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:30.316601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(2,1)-Total labeling of planar graphs with large maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Jinbo Li, Xin Zhang, Yong Yu","submitted_at":"2011-05-10T11:01:50Z","abstract_excerpt":"The ($d$,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we prove that, for planar graph $G$ with maximum degree $\\Delta\\geq12$ and $d=2$, the (2,1)-total labelling number $\\lambda_2^T(G)$ is at most $\\Delta+2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1908","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.1908","created_at":"2026-05-18T04:22:30.316660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1908v1","created_at":"2026-05-18T04:22:30.316660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1908","created_at":"2026-05-18T04:22:30.316660+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFXWBEGQBM55","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFXWBEGQBM55DUBT","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFXWBEGQ","created_at":"2026-05-18T12:26:41.206345+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/RFXWBEGQBM55DUBTNQIXTNOAHZ","json":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ.json","graph_json":"https://pith.science/api/pith-number/RFXWBEGQBM55DUBTNQIXTNOAHZ/graph.json","events_json":"https://pith.science/api/pith-number/RFXWBEGQBM55DUBTNQIXTNOAHZ/events.json","paper":"https://pith.science/paper/RFXWBEGQ"},"agent_actions":{"view_html":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ","download_json":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ.json","view_paper":"https://pith.science/paper/RFXWBEGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1908&json=true","fetch_graph":"https://pith.science/api/pith-number/RFXWBEGQBM55DUBTNQIXTNOAHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RFXWBEGQBM55DUBTNQIXTNOAHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ/action/storage_attestation","attest_author":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ/action/author_attestation","sign_citation":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ/action/citation_signature","submit_replication":"https://pith.science/pith/RFXWBEGQBM55DUBTNQIXTNOAHZ/action/replication_record"}},"created_at":"2026-05-18T04:22:30.316660+00:00","updated_at":"2026-05-18T04:22:30.316660+00:00"}