{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T6YNGYE45EMPA27JFKBEAMHJ2J","short_pith_number":"pith:T6YNGYE4","schema_version":"1.0","canonical_sha256":"9fb0d3609ce918f06be92a824030e9d25d9152c88bd432555206f353e04ad691","source":{"kind":"arxiv","id":"1508.01820","version":1},"attestation_state":"computed","paper":{"title":"On Galvin orientations of line graphs and list-edge-colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jessica McDonald","submitted_at":"2015-08-07T21:19:23Z","abstract_excerpt":"The notion of a Galvin orientation of a line graph is introduced, generalizing the idea used by Galvin in his landmark proof of the list-edge-colouring conjecture for bipartite graphs. If L(G) has a proper Galvin orientation with respect to k, then it immediately implies that G is k-list-edge-colourable, but the converse is not true. The stronger property is studied in graphs of the form `bipartite plus an edge', the Petersen graph, cliques, and simple graphs without odd cycles of length 5 or longer."},"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":"1508.01820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-07T21:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"96b4e06b95be52cb16fc18088e59971cbf5b341a3c6b139c9983a4852755daed","abstract_canon_sha256":"6bfc12e3a2326bbccdf0fd56e29c01e8e0c1939474916c0be98e2ac38509d8f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:37.856080Z","signature_b64":"eSDxwOGtschuZ7L9Gs4rbnpcmRdRZloLclPyJH06kflQGDcGfKU1t9B0W6gymjiJKVI3dr32qMzY4SK2VpUjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fb0d3609ce918f06be92a824030e9d25d9152c88bd432555206f353e04ad691","last_reissued_at":"2026-05-18T01:35:37.855492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:37.855492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Galvin orientations of line graphs and list-edge-colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jessica McDonald","submitted_at":"2015-08-07T21:19:23Z","abstract_excerpt":"The notion of a Galvin orientation of a line graph is introduced, generalizing the idea used by Galvin in his landmark proof of the list-edge-colouring conjecture for bipartite graphs. If L(G) has a proper Galvin orientation with respect to k, then it immediately implies that G is k-list-edge-colourable, but the converse is not true. The stronger property is studied in graphs of the form `bipartite plus an edge', the Petersen graph, cliques, and simple graphs without odd cycles of length 5 or longer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01820","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":"1508.01820","created_at":"2026-05-18T01:35:37.855610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01820v1","created_at":"2026-05-18T01:35:37.855610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01820","created_at":"2026-05-18T01:35:37.855610+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6YNGYE45EMP","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6YNGYE45EMPA27J","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6YNGYE4","created_at":"2026-05-18T12:29:42.218222+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/T6YNGYE45EMPA27JFKBEAMHJ2J","json":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J.json","graph_json":"https://pith.science/api/pith-number/T6YNGYE45EMPA27JFKBEAMHJ2J/graph.json","events_json":"https://pith.science/api/pith-number/T6YNGYE45EMPA27JFKBEAMHJ2J/events.json","paper":"https://pith.science/paper/T6YNGYE4"},"agent_actions":{"view_html":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J","download_json":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J.json","view_paper":"https://pith.science/paper/T6YNGYE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01820&json=true","fetch_graph":"https://pith.science/api/pith-number/T6YNGYE45EMPA27JFKBEAMHJ2J/graph.json","fetch_events":"https://pith.science/api/pith-number/T6YNGYE45EMPA27JFKBEAMHJ2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J/action/storage_attestation","attest_author":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J/action/author_attestation","sign_citation":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J/action/citation_signature","submit_replication":"https://pith.science/pith/T6YNGYE45EMPA27JFKBEAMHJ2J/action/replication_record"}},"created_at":"2026-05-18T01:35:37.855610+00:00","updated_at":"2026-05-18T01:35:37.855610+00:00"}