{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GZ35DNRCN4EHOFQX4PQ2KFBBY7","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":"726da5dd6cab92f2122f9cb33e7b221e358c1b4be390f09bc8421f7bd669f243","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T02:31:18Z","title_canon_sha256":"54af3fe3aa8c759d7b37b978ad5425df40775b4d970a736bdf9aa3dcd7cfa17f"},"schema_version":"1.0","source":{"id":"1508.01266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01266","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01266v1","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01266","created_at":"2026-05-18T01:35:43Z"},{"alias_kind":"pith_short_12","alias_value":"GZ35DNRCN4EH","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GZ35DNRCN4EHOFQX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GZ35DNRC","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:6852e82f7bafe9d2a7153ef118f187ff029407cf0936d271cf7cfa944b2be3cb","target":"graph","created_at":"2026-05-18T01:35:43Z","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":"The acyclic chromatic index, denoted by $a'(G)$, of a graph $G$ is the minimum number of colours used in any proper edge colouring of $G$ such that the union of any two colour classes does not contain a cycle, that is, forms a forest. We show that $a'(G\\Box H)\\le a'(G) + a'(H)$ for any two graphs $G$ and $H$ such that $max\\{a'(G), a'(H)\\} > 1$. Here, $G \\Box H$ denotes the cartesian product of $G$ and $H$. This extends a recent result of [15] where tight and constructive bounds on $a'(G)$ were obtained for a class of grid-like graphs which can be expressed as the cartesian product of a number ","authors_text":"C.R. Subramanian, Rahul Muthu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T02:31:18Z","title":"Cartesian Product and Acyclic Edge Colouring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01266","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:8ff31e04ce1eae2fcfdc4507d8cfc298875ee980981f1ed5426f592410e32390","target":"record","created_at":"2026-05-18T01:35:43Z","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":"726da5dd6cab92f2122f9cb33e7b221e358c1b4be390f09bc8421f7bd669f243","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-06T02:31:18Z","title_canon_sha256":"54af3fe3aa8c759d7b37b978ad5425df40775b4d970a736bdf9aa3dcd7cfa17f"},"schema_version":"1.0","source":{"id":"1508.01266","kind":"arxiv","version":1}},"canonical_sha256":"3677d1b6226f08771617e3e1a51421c7cc79257b50d629e7447dbae892260bc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3677d1b6226f08771617e3e1a51421c7cc79257b50d629e7447dbae892260bc1","first_computed_at":"2026-05-18T01:35:43.024141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:43.024141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"karqGNd/Y9TNzKtmMYyO63+Nroh0i3rHTxI4K5JTYdxdSNDCAiMr6mrNb6biU7CKGgocVxAltLnymu8H00e1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:43.024597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ff31e04ce1eae2fcfdc4507d8cfc298875ee980981f1ed5426f592410e32390","sha256:6852e82f7bafe9d2a7153ef118f187ff029407cf0936d271cf7cfa944b2be3cb"],"state_sha256":"c1f5647b52db7f93943f1f5b9cc0aa7c84bc24ad9575da59af000a41f09af43b"}