{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FE66CN3VRPFDPQQKR6DJ4PIYN6","short_pith_number":"pith:FE66CN3V","schema_version":"1.0","canonical_sha256":"293de137758bca37c20a8f869e3d186faac2000da159f51da5e09962ff71a8a6","source":{"kind":"arxiv","id":"1901.01861","version":4},"attestation_state":"computed","paper":{"title":"On the Parameterized Complexity of $k$-Edge Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Bernard Ries, Dani\\\"el Paulusma, Esther Galby, Paloma T. Lima","submitted_at":"2019-01-07T15:02:07Z","abstract_excerpt":"For every fixed integer $k \\geq 1$, we prove that $k$-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree."},"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":"1901.01861","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-01-07T15:02:07Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"2efa40ab9037498d4f53e510b4bfe28e217ca211a8eb84590100bec639a6782d","abstract_canon_sha256":"d85468f57e9ecb8ca53baa9e3e64c694e454d58691aafdc932b2b1351fa95a25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:04.224295Z","signature_b64":"YgJtWfEFk+K7oDtUYQoLm8Nn2q4ELExei4fNKrfXQf8XytSKUX0MYs0Ss/1uk1eFyd4WpK5DkfuEsdkc00yHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"293de137758bca37c20a8f869e3d186faac2000da159f51da5e09962ff71a8a6","last_reissued_at":"2026-05-17T23:53:04.223804Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:04.223804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of $k$-Edge Colouring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Bernard Ries, Dani\\\"el Paulusma, Esther Galby, Paloma T. Lima","submitted_at":"2019-01-07T15:02:07Z","abstract_excerpt":"For every fixed integer $k \\geq 1$, we prove that $k$-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01861","kind":"arxiv","version":4},"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":"1901.01861","created_at":"2026-05-17T23:53:04.223880+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01861v4","created_at":"2026-05-17T23:53:04.223880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01861","created_at":"2026-05-17T23:53:04.223880+00:00"},{"alias_kind":"pith_short_12","alias_value":"FE66CN3VRPFD","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FE66CN3VRPFDPQQK","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FE66CN3V","created_at":"2026-05-18T12:33:15.570797+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/FE66CN3VRPFDPQQKR6DJ4PIYN6","json":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6.json","graph_json":"https://pith.science/api/pith-number/FE66CN3VRPFDPQQKR6DJ4PIYN6/graph.json","events_json":"https://pith.science/api/pith-number/FE66CN3VRPFDPQQKR6DJ4PIYN6/events.json","paper":"https://pith.science/paper/FE66CN3V"},"agent_actions":{"view_html":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6","download_json":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6.json","view_paper":"https://pith.science/paper/FE66CN3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01861&json=true","fetch_graph":"https://pith.science/api/pith-number/FE66CN3VRPFDPQQKR6DJ4PIYN6/graph.json","fetch_events":"https://pith.science/api/pith-number/FE66CN3VRPFDPQQKR6DJ4PIYN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6/action/storage_attestation","attest_author":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6/action/author_attestation","sign_citation":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6/action/citation_signature","submit_replication":"https://pith.science/pith/FE66CN3VRPFDPQQKR6DJ4PIYN6/action/replication_record"}},"created_at":"2026-05-17T23:53:04.223880+00:00","updated_at":"2026-05-17T23:53:04.223880+00:00"}