{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:FXVDJSJDROVLKXC4PKX52HMIDW","short_pith_number":"pith:FXVDJSJD","schema_version":"1.0","canonical_sha256":"2dea34c9238baab55c5c7aafdd1d881d931f0c2fe2c06b8c501c07fa43370f82","source":{"kind":"arxiv","id":"0804.4681","version":1},"attestation_state":"computed","paper":{"title":"$d$-Regular graphs of acyclic chromatic index at least $d+2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Sunil Chandran, Manoj Kummini, Manu Basavaraju","submitted_at":"2008-04-29T19:18:52Z","abstract_excerpt":"An $acyclic$ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \\emph{acyclic chromatic index} of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks\n  (and earlier by Fiamcik) that $a'(G)\\le \\Delta+2$, where $\\Delta =\\Delta(G)$ denotes the maximum degree of the graph. Alon et.al also raised the question whether the complete graphs of even order are the only regular graphs which require $\\Delta+2$ colors to be acyclically edge colored. In"},"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":"0804.4681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-04-29T19:18:52Z","cross_cats_sorted":[],"title_canon_sha256":"2aaf94b8c0ee4d0d01dce6236f245a095ee8d07b77b4edf3304c6195e4b2156a","abstract_canon_sha256":"ac45f34a27c524e92af9f056b8437d58fffc4ae480f6c13eebe3b3ae528137cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:30.741181Z","signature_b64":"Jz0CVUZoYg/JhINq0drJc/k2geUGT4gjWhUkxxbywPiNSVIXiYDXqNCJaXQ/H4yLAk1ca1zbO+WYzCRu9kwbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dea34c9238baab55c5c7aafdd1d881d931f0c2fe2c06b8c501c07fa43370f82","last_reissued_at":"2026-05-18T03:39:30.740355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:30.740355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$d$-Regular graphs of acyclic chromatic index at least $d+2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"L. Sunil Chandran, Manoj Kummini, Manu Basavaraju","submitted_at":"2008-04-29T19:18:52Z","abstract_excerpt":"An $acyclic$ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \\emph{acyclic chromatic index} of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks\n  (and earlier by Fiamcik) that $a'(G)\\le \\Delta+2$, where $\\Delta =\\Delta(G)$ denotes the maximum degree of the graph. Alon et.al also raised the question whether the complete graphs of even order are the only regular graphs which require $\\Delta+2$ colors to be acyclically edge colored. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4681","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":"0804.4681","created_at":"2026-05-18T03:39:30.740507+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.4681v1","created_at":"2026-05-18T03:39:30.740507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4681","created_at":"2026-05-18T03:39:30.740507+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXVDJSJDROVL","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXVDJSJDROVLKXC4","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXVDJSJD","created_at":"2026-05-18T12:25:57.157939+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/FXVDJSJDROVLKXC4PKX52HMIDW","json":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW.json","graph_json":"https://pith.science/api/pith-number/FXVDJSJDROVLKXC4PKX52HMIDW/graph.json","events_json":"https://pith.science/api/pith-number/FXVDJSJDROVLKXC4PKX52HMIDW/events.json","paper":"https://pith.science/paper/FXVDJSJD"},"agent_actions":{"view_html":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW","download_json":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW.json","view_paper":"https://pith.science/paper/FXVDJSJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.4681&json=true","fetch_graph":"https://pith.science/api/pith-number/FXVDJSJDROVLKXC4PKX52HMIDW/graph.json","fetch_events":"https://pith.science/api/pith-number/FXVDJSJDROVLKXC4PKX52HMIDW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW/action/storage_attestation","attest_author":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW/action/author_attestation","sign_citation":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW/action/citation_signature","submit_replication":"https://pith.science/pith/FXVDJSJDROVLKXC4PKX52HMIDW/action/replication_record"}},"created_at":"2026-05-18T03:39:30.740507+00:00","updated_at":"2026-05-18T03:39:30.740507+00:00"}