{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HE4XTG4WSTFS3PUTDC2LAX2P2Y","short_pith_number":"pith:HE4XTG4W","schema_version":"1.0","canonical_sha256":"3939799b9694cb2dbe9318b4b05f4fd602f2f6d51baf47aa4d4ac35193f87734","source":{"kind":"arxiv","id":"1509.00275","version":1},"attestation_state":"computed","paper":{"title":"A characterization of L(2, 1)-labeling number for trees with maximum degree 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Chen, Pak Kiu Sun, Qiaojun Shu, Wai Chee Shiu, Weifan Wang","submitted_at":"2015-09-01T13:24:18Z","abstract_excerpt":"An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at distance 2 are assigned distinct numbers. The L(2, 1)-labeling number is the minimum range of labels over all such labeling. It was shown by Griggs and Yeh [Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5(1992), 586-595] that the L(2, 1)-labeling number of a tree is either \\D+ 1 or \\D + 2. In this paper, we give a complete characterization of L(2, 1)-labeling number for trees with maximum degre"},"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":"1509.00275","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-01T13:24:18Z","cross_cats_sorted":[],"title_canon_sha256":"7d4f21147c3fc949309fb4d84a18908711ae764b0f139ca3c4620e0fc5839e83","abstract_canon_sha256":"06dfc1bf27fc559063f4ac7143827991a1b484922c37f243c81ddfeb16169142"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.590450Z","signature_b64":"hocxtdyxU4XaXdFXOiCKBkzZel6ab3uD6cByWH65yxtobbAi/a7opygr27pPJV7w7tlUug70o2xu29hxMvG3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3939799b9694cb2dbe9318b4b05f4fd602f2f6d51baf47aa4d4ac35193f87734","last_reissued_at":"2026-05-18T01:34:14.589621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.589621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A characterization of L(2, 1)-labeling number for trees with maximum degree 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Chen, Pak Kiu Sun, Qiaojun Shu, Wai Chee Shiu, Weifan Wang","submitted_at":"2015-09-01T13:24:18Z","abstract_excerpt":"An L(2, 1)-labeling of a graph is an assignment of nonnegative integers to the vertices of G such that adjacent vertices receive numbers differed by at least 2, and vertices at distance 2 are assigned distinct numbers. The L(2, 1)-labeling number is the minimum range of labels over all such labeling. It was shown by Griggs and Yeh [Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5(1992), 586-595] that the L(2, 1)-labeling number of a tree is either \\D+ 1 or \\D + 2. In this paper, we give a complete characterization of L(2, 1)-labeling number for trees with maximum degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00275","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":"1509.00275","created_at":"2026-05-18T01:34:14.589741+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00275v1","created_at":"2026-05-18T01:34:14.589741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00275","created_at":"2026-05-18T01:34:14.589741+00:00"},{"alias_kind":"pith_short_12","alias_value":"HE4XTG4WSTFS","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HE4XTG4WSTFS3PUT","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HE4XTG4W","created_at":"2026-05-18T12:29:25.134429+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/HE4XTG4WSTFS3PUTDC2LAX2P2Y","json":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y.json","graph_json":"https://pith.science/api/pith-number/HE4XTG4WSTFS3PUTDC2LAX2P2Y/graph.json","events_json":"https://pith.science/api/pith-number/HE4XTG4WSTFS3PUTDC2LAX2P2Y/events.json","paper":"https://pith.science/paper/HE4XTG4W"},"agent_actions":{"view_html":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y","download_json":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y.json","view_paper":"https://pith.science/paper/HE4XTG4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00275&json=true","fetch_graph":"https://pith.science/api/pith-number/HE4XTG4WSTFS3PUTDC2LAX2P2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/HE4XTG4WSTFS3PUTDC2LAX2P2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y/action/storage_attestation","attest_author":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y/action/author_attestation","sign_citation":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y/action/citation_signature","submit_replication":"https://pith.science/pith/HE4XTG4WSTFS3PUTDC2LAX2P2Y/action/replication_record"}},"created_at":"2026-05-18T01:34:14.589741+00:00","updated_at":"2026-05-18T01:34:14.589741+00:00"}