{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3SHPM4MKAP4WW26JZLOIZ7BYDI","short_pith_number":"pith:3SHPM4MK","schema_version":"1.0","canonical_sha256":"dc8ef6718a03f96b6bc9cadc8cfc381a261e45e33e4c18478a22aec3b685d041","source":{"kind":"arxiv","id":"1507.05933","version":6},"attestation_state":"computed","paper":{"title":"The list chromatic index of simple graphs whose odd cycles intersect in at most one edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo, Jessica McDonald","submitted_at":"2015-07-21T18:14:05Z","abstract_excerpt":"We study the class of simple graphs $\\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\\mathcal{G}^*$ and prove that every $G \\in \\mathcal{G}^*$ satisfies the list-edge-coloring conjecture. When $\\Delta(G) \\geq 4$, we in fact prove a stronger result about kernel-perfect orientations in $L(G)$ which implies that $G$ is $(m\\Delta(G):m)$-edge-choosable and $\\Delta(G)$-edge-paintable for every $m \\geq 1$."},"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":"1507.05933","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T18:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"d9c97a1a3db9a022801b36a99bb257150be334bd06e05ba1db1c0bf89fbb56d6","abstract_canon_sha256":"bb218dc3492aafa902e9556438479e4bde05cb6ae2ffd584643d7fdd18905b5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.923770Z","signature_b64":"yGpZsPJY/Dyrmvqe/cPhwTiyoi+H9uL+05LZXpZrNGS5uTjVVgcGKO2N6V2m2sK0OqP6sc2qCRk8dG/Bn7U1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8ef6718a03f96b6bc9cadc8cfc381a261e45e33e4c18478a22aec3b685d041","last_reissued_at":"2026-05-18T00:30:17.923120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.923120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The list chromatic index of simple graphs whose odd cycles intersect in at most one edge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory J. Puleo, Jessica McDonald","submitted_at":"2015-07-21T18:14:05Z","abstract_excerpt":"We study the class of simple graphs $\\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\\mathcal{G}^*$ and prove that every $G \\in \\mathcal{G}^*$ satisfies the list-edge-coloring conjecture. When $\\Delta(G) \\geq 4$, we in fact prove a stronger result about kernel-perfect orientations in $L(G)$ which implies that $G$ is $(m\\Delta(G):m)$-edge-choosable and $\\Delta(G)$-edge-paintable for every $m \\geq 1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05933","kind":"arxiv","version":6},"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":"1507.05933","created_at":"2026-05-18T00:30:17.923228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05933v6","created_at":"2026-05-18T00:30:17.923228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05933","created_at":"2026-05-18T00:30:17.923228+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SHPM4MKAP4W","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SHPM4MKAP4WW26J","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SHPM4MK","created_at":"2026-05-18T12:29:02.477457+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/3SHPM4MKAP4WW26JZLOIZ7BYDI","json":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI.json","graph_json":"https://pith.science/api/pith-number/3SHPM4MKAP4WW26JZLOIZ7BYDI/graph.json","events_json":"https://pith.science/api/pith-number/3SHPM4MKAP4WW26JZLOIZ7BYDI/events.json","paper":"https://pith.science/paper/3SHPM4MK"},"agent_actions":{"view_html":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI","download_json":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI.json","view_paper":"https://pith.science/paper/3SHPM4MK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05933&json=true","fetch_graph":"https://pith.science/api/pith-number/3SHPM4MKAP4WW26JZLOIZ7BYDI/graph.json","fetch_events":"https://pith.science/api/pith-number/3SHPM4MKAP4WW26JZLOIZ7BYDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/action/storage_attestation","attest_author":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/action/author_attestation","sign_citation":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/action/citation_signature","submit_replication":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/action/replication_record"}},"created_at":"2026-05-18T00:30:17.923228+00:00","updated_at":"2026-05-18T00:30:17.923228+00:00"}