{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HZCGJ2E52DHU33V7GRBY7EUAAY","short_pith_number":"pith:HZCGJ2E5","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"},"canonical_sha256":"3e4464e89dd0cf4deebf34438f9280063224e7c201f9f9c9172955f300e2eded","source":{"kind":"arxiv","id":"1603.04121","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04121","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04121v1","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04121","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"HZCGJ2E52DHU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HZCGJ2E52DHU33V7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HZCGJ2E5","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HZCGJ2E52DHU33V7GRBY7EUAAY","target":"record","payload":{"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"},"canonical_sha256":"3e4464e89dd0cf4deebf34438f9280063224e7c201f9f9c9172955f300e2eded","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"},"source_kind":"arxiv","source_id":"1603.04121","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cD5U2RFujl6dUENrLDV0S+HP3A4DcYcUzQ1SN1mlF6eiN2B1wKECNNgb00wUZMUPkAgwr5riSoYY0xA56Z4OBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:40:04.866841Z"},"content_sha256":"65e6ed00dee1896a9f7541fe7f5a3033cff2381d81b8212898637c858fde4d9b","schema_version":"1.0","event_id":"sha256:65e6ed00dee1896a9f7541fe7f5a3033cff2381d81b8212898637c858fde4d9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HZCGJ2E52DHU33V7GRBY7EUAAY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4LDdvaY++Aytj8YbArxr6M2YOrTh/YNQVjJeUD7RlEEF90efcmVxmoeyfGZeoC1NobeUQG9omtwmCSoAPFyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:40:04.867182Z"},"content_sha256":"5f7979e57ca65853e95dd9a8997bbc32e6f3d2cc7fec58aae1fec9782079e8c0","schema_version":"1.0","event_id":"sha256:5f7979e57ca65853e95dd9a8997bbc32e6f3d2cc7fec58aae1fec9782079e8c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/bundle.json","state_url":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:40:04Z","links":{"resolver":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY","bundle":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/bundle.json","state":"https://pith.science/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZCGJ2E52DHU33V7GRBY7EUAAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HZCGJ2E52DHU33V7GRBY7EUAAY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f35aee30f5e3594c93170a4770184b8f77a568b0fb539f764061fd2898b8c810","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T03:18:30Z","title_canon_sha256":"821a951b4b09c3521e1e8770c88e389321d782fbaec9b70161b5c777be9db4e9"},"schema_version":"1.0","source":{"id":"1603.04121","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04121","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04121v1","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04121","created_at":"2026-05-18T01:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"HZCGJ2E52DHU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HZCGJ2E52DHU33V7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HZCGJ2E5","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:5f7979e57ca65853e95dd9a8997bbc32e6f3d2cc7fec58aae1fec9782079e8c0","target":"graph","created_at":"2026-05-18T01:19:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"He Li, Nan Jia, Yaping Mao, Zhiwei Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T03:18:30Z","title":"Line k-Arboricity in Product Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04121","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:65e6ed00dee1896a9f7541fe7f5a3033cff2381d81b8212898637c858fde4d9b","target":"record","created_at":"2026-05-18T01:19:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f35aee30f5e3594c93170a4770184b8f77a568b0fb539f764061fd2898b8c810","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T03:18:30Z","title_canon_sha256":"821a951b4b09c3521e1e8770c88e389321d782fbaec9b70161b5c777be9db4e9"},"schema_version":"1.0","source":{"id":"1603.04121","kind":"arxiv","version":1}},"canonical_sha256":"3e4464e89dd0cf4deebf34438f9280063224e7c201f9f9c9172955f300e2eded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e4464e89dd0cf4deebf34438f9280063224e7c201f9f9c9172955f300e2eded","first_computed_at":"2026-05-18T01:19:09.358002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:09.358002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HWaWbVWH2rw0pqd3m6IJvOcbgwm03ebKMDBVGBe1uKmFePW/nALagwKLT6LMvnGtdnHPXS9wr6QaN36/s78WDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:09.358711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04121","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65e6ed00dee1896a9f7541fe7f5a3033cff2381d81b8212898637c858fde4d9b","sha256:5f7979e57ca65853e95dd9a8997bbc32e6f3d2cc7fec58aae1fec9782079e8c0"],"state_sha256":"f56784d24fe40dbc0626c7e81d9d7da1d2881bd57f988f904f50c39f49a41588"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TeFshcQJQWAXG6E1VWdx57dRvvxkogSmZEaDi06uMcEIS+wdCuJ3U1s2TE0tKsJp8EP8/tEP/Si0SmhmYuBXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:40:04.869170Z","bundle_sha256":"75d061e2421e40cbc64d360a47a4c0098b74be83f719b3de541c7dc6b1064b4b"}}