{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZITZY7QIC6KZJEOFJYUIL7EZLW","short_pith_number":"pith:ZITZY7QI","schema_version":"1.0","canonical_sha256":"ca279c7e0817959491c54e2885fc995d92f5e9b6eaeca324e39c2a9dacb29015","source":{"kind":"arxiv","id":"1504.02122","version":1},"attestation_state":"computed","paper":{"title":"On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Lang","submitted_at":"2015-04-08T20:46:49Z","abstract_excerpt":"Among other results, it is shown that 3-trees are $\\Delta$-edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are $\\Delta$-edge-choosable."},"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":"1504.02122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-08T20:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"7fe8b8672333b8862082c9e96fabaf89f5c20c8f65974d7c5332132f2d317e3e","abstract_canon_sha256":"31c2ee7867cdd10d2606ada37eeda8a2cc915744b1698946c111a3e39214702b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:15.995874Z","signature_b64":"+1jkVSskMpvXoWKEaOVF06RmeK8ZWFshYzc3dotEjBW5aPkXf9rad8Pib7LW23v8ATccBhS7Q8nBBA7zKsfIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca279c7e0817959491c54e2885fc995d92f5e9b6eaeca324e39c2a9dacb29015","last_reissued_at":"2026-05-18T02:19:15.995153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:15.995153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Lang","submitted_at":"2015-04-08T20:46:49Z","abstract_excerpt":"Among other results, it is shown that 3-trees are $\\Delta$-edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are $\\Delta$-edge-choosable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02122","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":"1504.02122","created_at":"2026-05-18T02:19:15.995265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02122v1","created_at":"2026-05-18T02:19:15.995265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02122","created_at":"2026-05-18T02:19:15.995265+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZITZY7QIC6KZ","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZITZY7QIC6KZJEOF","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZITZY7QI","created_at":"2026-05-18T12:29:52.810259+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/ZITZY7QIC6KZJEOFJYUIL7EZLW","json":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW.json","graph_json":"https://pith.science/api/pith-number/ZITZY7QIC6KZJEOFJYUIL7EZLW/graph.json","events_json":"https://pith.science/api/pith-number/ZITZY7QIC6KZJEOFJYUIL7EZLW/events.json","paper":"https://pith.science/paper/ZITZY7QI"},"agent_actions":{"view_html":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW","download_json":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW.json","view_paper":"https://pith.science/paper/ZITZY7QI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02122&json=true","fetch_graph":"https://pith.science/api/pith-number/ZITZY7QIC6KZJEOFJYUIL7EZLW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZITZY7QIC6KZJEOFJYUIL7EZLW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW/action/storage_attestation","attest_author":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW/action/author_attestation","sign_citation":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW/action/citation_signature","submit_replication":"https://pith.science/pith/ZITZY7QIC6KZJEOFJYUIL7EZLW/action/replication_record"}},"created_at":"2026-05-18T02:19:15.995265+00:00","updated_at":"2026-05-18T02:19:15.995265+00:00"}