{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HZCGJ2E52DHU33V7GRBY7EUAAY","short_pith_number":"pith:HZCGJ2E5","schema_version":"1.0","canonical_sha256":"3e4464e89dd0cf4deebf34438f9280063224e7c201f9f9c9172955f300e2eded","source":{"kind":"arxiv","id":"1603.04121","version":1},"attestation_state":"computed","paper":{"title":"Line k-Arboricity in Product Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"He Li, Nan Jia, Yaping Mao, Zhiwei Guo","submitted_at":"2016-03-14T03:18:30Z","abstract_excerpt":"A \\emph{linear $k$-forest} is a forest whose components are paths of length at most $k$. The \\emph{linear $k$-arboricity} of a graph $G$, denoted by ${\\rm la}_k(G)$, is the least number of linear $k$-forests needed to decompose $G$. Recently, Zuo, He and Xue studied the exact values of the linear $(n-1)$-arboricity of Cartesian products of various combinations of complete graphs, cycles, complete multipartite graphs. In this paper, for general $k$ we show that $\\max\\{{\\rm la}_{k}(G),{\\rm la}_{\\ell}(H)\\}\\leq {\\rm la}_{\\max\\{k,\\ell\\}}(G\\Box H)\\leq {\\rm la}_{k}(G)+{\\rm la}_{\\ell}(H)$ for any two "},"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":"1603.04121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T03:18:30Z","cross_cats_sorted":[],"title_canon_sha256":"821a951b4b09c3521e1e8770c88e389321d782fbaec9b70161b5c777be9db4e9","abstract_canon_sha256":"f35aee30f5e3594c93170a4770184b8f77a568b0fb539f764061fd2898b8c810"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:09.358711Z","signature_b64":"HWaWbVWH2rw0pqd3m6IJvOcbgwm03ebKMDBVGBe1uKmFePW/nALagwKLT6LMvnGtdnHPXS9wr6QaN36/s78WDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e4464e89dd0cf4deebf34438f9280063224e7c201f9f9c9172955f300e2eded","last_reissued_at":"2026-05-18T01:19:09.358002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:09.358002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Line k-Arboricity in Product Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"He Li, Nan Jia, Yaping Mao, Zhiwei Guo","submitted_at":"2016-03-14T03:18:30Z","abstract_excerpt":"A \\emph{linear $k$-forest} is a forest whose components are paths of length at most $k$. The \\emph{linear $k$-arboricity} of a graph $G$, denoted by ${\\rm la}_k(G)$, is the least number of linear $k$-forests needed to decompose $G$. Recently, Zuo, He and Xue studied the exact values of the linear $(n-1)$-arboricity of Cartesian products of various combinations of complete graphs, cycles, complete multipartite graphs. In this paper, for general $k$ we show that $\\max\\{{\\rm la}_{k}(G),{\\rm la}_{\\ell}(H)\\}\\leq {\\rm la}_{\\max\\{k,\\ell\\}}(G\\Box H)\\leq {\\rm la}_{k}(G)+{\\rm la}_{\\ell}(H)$ for any two "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04121","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":"1603.04121","created_at":"2026-05-18T01:19:09.358106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04121v1","created_at":"2026-05-18T01:19:09.358106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04121","created_at":"2026-05-18T01:19:09.358106+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZCGJ2E52DHU","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZCGJ2E52DHU33V7","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZCGJ2E5","created_at":"2026-05-18T12:30:22.444734+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/HZCGJ2E52DHU33V7GRBY7EUAAY","json":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY.json","graph_json":"https://pith.science/api/pith-number/HZCGJ2E52DHU33V7GRBY7EUAAY/graph.json","events_json":"https://pith.science/api/pith-number/HZCGJ2E52DHU33V7GRBY7EUAAY/events.json","paper":"https://pith.science/paper/HZCGJ2E5"},"agent_actions":{"view_html":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY","download_json":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY.json","view_paper":"https://pith.science/paper/HZCGJ2E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04121&json=true","fetch_graph":"https://pith.science/api/pith-number/HZCGJ2E52DHU33V7GRBY7EUAAY/graph.json","fetch_events":"https://pith.science/api/pith-number/HZCGJ2E52DHU33V7GRBY7EUAAY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/action/storage_attestation","attest_author":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/action/author_attestation","sign_citation":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/action/citation_signature","submit_replication":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/action/replication_record"}},"created_at":"2026-05-18T01:19:09.358106+00:00","updated_at":"2026-05-18T01:19:09.358106+00:00"}