{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3SHPM4MKAP4WW26JZLOIZ7BYDI","short_pith_number":"pith:3SHPM4MK","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"},"canonical_sha256":"dc8ef6718a03f96b6bc9cadc8cfc381a261e45e33e4c18478a22aec3b685d041","source":{"kind":"arxiv","id":"1507.05933","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05933","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05933v6","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05933","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"3SHPM4MKAP4W","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3SHPM4MKAP4WW26J","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3SHPM4MK","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3SHPM4MKAP4WW26JZLOIZ7BYDI","target":"record","payload":{"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"},"canonical_sha256":"dc8ef6718a03f96b6bc9cadc8cfc381a261e45e33e4c18478a22aec3b685d041","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"},"source_kind":"arxiv","source_id":"1507.05933","source_version":6,"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-18T00:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pQ9EITmoPBtWD+T40BjRa2R+ngiEsXtaRb6Se0XBWi2cmZfQSlglRtTcMU83XbI6IJv7qwS1dIbKbYkiHrVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:56:00.366726Z"},"content_sha256":"c1a13897fe662c896f8d6c4f3dbc67632b2cce35d17ed2ed6ce52a74827e7069","schema_version":"1.0","event_id":"sha256:c1a13897fe662c896f8d6c4f3dbc67632b2cce35d17ed2ed6ce52a74827e7069"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3SHPM4MKAP4WW26JZLOIZ7BYDI","target":"graph","payload":{"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"},"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-18T00:30:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LC5tlIZdGxzj1BDcsIuepGJ2F1i5KJw14jVkVyUc7cvO3705BvdNU1ZU5uYbJCGIw0YYT7wBpVJlByu+IeVSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:56:00.367392Z"},"content_sha256":"feacfe38fc85f21d1e5f2498be6a2e00bc2601dcc4bd94e023b75d76cec0205c","schema_version":"1.0","event_id":"sha256:feacfe38fc85f21d1e5f2498be6a2e00bc2601dcc4bd94e023b75d76cec0205c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/bundle.json","state_url":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/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-08T07:56:00Z","links":{"resolver":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI","bundle":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/bundle.json","state":"https://pith.science/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SHPM4MKAP4WW26JZLOIZ7BYDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3SHPM4MKAP4WW26JZLOIZ7BYDI","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":"bb218dc3492aafa902e9556438479e4bde05cb6ae2ffd584643d7fdd18905b5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T18:14:05Z","title_canon_sha256":"d9c97a1a3db9a022801b36a99bb257150be334bd06e05ba1db1c0bf89fbb56d6"},"schema_version":"1.0","source":{"id":"1507.05933","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05933","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05933v6","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05933","created_at":"2026-05-18T00:30:17Z"},{"alias_kind":"pith_short_12","alias_value":"3SHPM4MKAP4W","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3SHPM4MKAP4WW26J","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3SHPM4MK","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:feacfe38fc85f21d1e5f2498be6a2e00bc2601dcc4bd94e023b75d76cec0205c","target":"graph","created_at":"2026-05-18T00:30:17Z","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":"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$.","authors_text":"Gregory J. Puleo, Jessica McDonald","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T18:14:05Z","title":"The list chromatic index of simple graphs whose odd cycles intersect in at most one edge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05933","kind":"arxiv","version":6},"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:c1a13897fe662c896f8d6c4f3dbc67632b2cce35d17ed2ed6ce52a74827e7069","target":"record","created_at":"2026-05-18T00:30:17Z","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":"bb218dc3492aafa902e9556438479e4bde05cb6ae2ffd584643d7fdd18905b5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T18:14:05Z","title_canon_sha256":"d9c97a1a3db9a022801b36a99bb257150be334bd06e05ba1db1c0bf89fbb56d6"},"schema_version":"1.0","source":{"id":"1507.05933","kind":"arxiv","version":6}},"canonical_sha256":"dc8ef6718a03f96b6bc9cadc8cfc381a261e45e33e4c18478a22aec3b685d041","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc8ef6718a03f96b6bc9cadc8cfc381a261e45e33e4c18478a22aec3b685d041","first_computed_at":"2026-05-18T00:30:17.923120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:17.923120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yGpZsPJY/Dyrmvqe/cPhwTiyoi+H9uL+05LZXpZrNGS5uTjVVgcGKO2N6V2m2sK0OqP6sc2qCRk8dG/Bn7U1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:17.923770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05933","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1a13897fe662c896f8d6c4f3dbc67632b2cce35d17ed2ed6ce52a74827e7069","sha256:feacfe38fc85f21d1e5f2498be6a2e00bc2601dcc4bd94e023b75d76cec0205c"],"state_sha256":"e041896c91a069d9b19df36f76eaecc40c1136d1866e923ccba9d9eda34048c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHRR9ocLin6IgtBKUL3f5BFThTtXmDCtP5IqoZ6wy29Ct1dqQLIAPDU3a7wWxAgJVg0mxHR367f9dzquJX51BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T07:56:00.372189Z","bundle_sha256":"72b64cef47a2a8c5086aec7415c6dab443dfa202d17c504652b54ef31b00b823"}}