{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:77KCQLBWYG26DNEGEEZOZWB367","short_pith_number":"pith:77KCQLBW","schema_version":"1.0","canonical_sha256":"ffd4282c36c1b5e1b4862132ecd83bf7dab251144da21e17777d9615f9286c93","source":{"kind":"arxiv","id":"1309.1545","version":2},"attestation_state":"computed","paper":{"title":"Linear and cyclic distance-three labellings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deborah King, Kelvin Yang Li, Sanming Zhou","submitted_at":"2013-09-06T06:33:59Z","abstract_excerpt":"Given a finite or infinite graph $G$ and positive integers $\\ell, h_1, h_2, h_3$, an $L(h_1, h_2, h_3)$-labelling of $G$ with span $\\ell$ is a mapping $f: V(G) \\rightarrow \\{0, 1, 2, \\ldots, \\ell\\}$ such that, for $i = 1, 2, 3$ and any $u, v \\in V(G)$ at distance $i$ in $G$, $|f(u) - f(v)| \\geq h_i$. A $C(h_1, h_2, h_3)$-labelling of $G$ with span $\\ell$ is defined similarly by requiring $|f(u) - f(v)|_{\\ell} \\ge h_i$ instead, where $|x|_{\\ell} = \\min\\{|x|, \\ell-|x|\\}$. The minimum span of an $L(h_1, h_2, h_3)$-labelling, or a $C(h_1, h_2, h_3)$-labelling, of $G$ is denoted by $\\lambda_{h_1,h_"},"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":"1309.1545","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-06T06:33:59Z","cross_cats_sorted":[],"title_canon_sha256":"cd8969bb62808c3632519247de011fbfcb495ff9344b59e8da7a7e3e2a709b5c","abstract_canon_sha256":"e5d671a2904b2cd76887135a70212f2a90730abfb2d64e741f1e493f72416f50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:37.081937Z","signature_b64":"T7GptpvCMRm8SxgvAybpnm6p+64UXD8NIp11/Afn9xHuE3kRqlVd+3KUPLvy2Hub5Y9tJ9wc3dIan+W0S80uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffd4282c36c1b5e1b4862132ecd83bf7dab251144da21e17777d9615f9286c93","last_reissued_at":"2026-05-18T02:20:37.081229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:37.081229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear and cyclic distance-three labellings of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Deborah King, Kelvin Yang Li, Sanming Zhou","submitted_at":"2013-09-06T06:33:59Z","abstract_excerpt":"Given a finite or infinite graph $G$ and positive integers $\\ell, h_1, h_2, h_3$, an $L(h_1, h_2, h_3)$-labelling of $G$ with span $\\ell$ is a mapping $f: V(G) \\rightarrow \\{0, 1, 2, \\ldots, \\ell\\}$ such that, for $i = 1, 2, 3$ and any $u, v \\in V(G)$ at distance $i$ in $G$, $|f(u) - f(v)| \\geq h_i$. A $C(h_1, h_2, h_3)$-labelling of $G$ with span $\\ell$ is defined similarly by requiring $|f(u) - f(v)|_{\\ell} \\ge h_i$ instead, where $|x|_{\\ell} = \\min\\{|x|, \\ell-|x|\\}$. The minimum span of an $L(h_1, h_2, h_3)$-labelling, or a $C(h_1, h_2, h_3)$-labelling, of $G$ is denoted by $\\lambda_{h_1,h_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1545","kind":"arxiv","version":2},"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":"1309.1545","created_at":"2026-05-18T02:20:37.081336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1545v2","created_at":"2026-05-18T02:20:37.081336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1545","created_at":"2026-05-18T02:20:37.081336+00:00"},{"alias_kind":"pith_short_12","alias_value":"77KCQLBWYG26","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"77KCQLBWYG26DNEG","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"77KCQLBW","created_at":"2026-05-18T12:27:36.564083+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/77KCQLBWYG26DNEGEEZOZWB367","json":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367.json","graph_json":"https://pith.science/api/pith-number/77KCQLBWYG26DNEGEEZOZWB367/graph.json","events_json":"https://pith.science/api/pith-number/77KCQLBWYG26DNEGEEZOZWB367/events.json","paper":"https://pith.science/paper/77KCQLBW"},"agent_actions":{"view_html":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367","download_json":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367.json","view_paper":"https://pith.science/paper/77KCQLBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1545&json=true","fetch_graph":"https://pith.science/api/pith-number/77KCQLBWYG26DNEGEEZOZWB367/graph.json","fetch_events":"https://pith.science/api/pith-number/77KCQLBWYG26DNEGEEZOZWB367/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367/action/timestamp_anchor","attest_storage":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367/action/storage_attestation","attest_author":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367/action/author_attestation","sign_citation":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367/action/citation_signature","submit_replication":"https://pith.science/pith/77KCQLBWYG26DNEGEEZOZWB367/action/replication_record"}},"created_at":"2026-05-18T02:20:37.081336+00:00","updated_at":"2026-05-18T02:20:37.081336+00:00"}