{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B7GZHCPI74GDXHBSERKDPZ2ZZA","short_pith_number":"pith:B7GZHCPI","schema_version":"1.0","canonical_sha256":"0fcd9389e8ff0c3b9c32245437e759c83ec9fddb5a0e01f3ac314896f8a0ba2f","source":{"kind":"arxiv","id":"1810.04379","version":1},"attestation_state":"computed","paper":{"title":"Classifying k-Edge Colouring for H-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bernard Ries, Daniel Paulusma, Esther Galby, Paloma T. Lima","submitted_at":"2018-10-10T06:03:12Z","abstract_excerpt":"A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. For every integer $k$ and every graph $H$, we determine the computational complexity of $k$-Edge Colouring for $H$-free graphs."},"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":"1810.04379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-10T06:03:12Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"4ffd72128c32f527f90288d077500e0832d4841444fcdb4d9e6983c6f30579f1","abstract_canon_sha256":"8baa0c01806ce4aee017557a6816bf702ed9e63d64872db933053fb48489d04e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:40.304811Z","signature_b64":"b3f0gBB7v1PtSoKsMzUq0CAaYI2Z2FIEx7+YR+YHCZsYoqMq2L7Z5X8AdBJAi1LCGNLyv2XZkArS0za8LH4fAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fcd9389e8ff0c3b9c32245437e759c83ec9fddb5a0e01f3ac314896f8a0ba2f","last_reissued_at":"2026-05-18T00:03:40.304367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:40.304367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classifying k-Edge Colouring for H-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bernard Ries, Daniel Paulusma, Esther Galby, Paloma T. Lima","submitted_at":"2018-10-10T06:03:12Z","abstract_excerpt":"A graph is $H$-free if it does not contain an induced subgraph isomorphic to $H$. For every integer $k$ and every graph $H$, we determine the computational complexity of $k$-Edge Colouring for $H$-free graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04379","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":"1810.04379","created_at":"2026-05-18T00:03:40.304436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.04379v1","created_at":"2026-05-18T00:03:40.304436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04379","created_at":"2026-05-18T00:03:40.304436+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7GZHCPI74GD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7GZHCPI74GDXHBS","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7GZHCPI","created_at":"2026-05-18T12:32:13.499390+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/B7GZHCPI74GDXHBSERKDPZ2ZZA","json":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA.json","graph_json":"https://pith.science/api/pith-number/B7GZHCPI74GDXHBSERKDPZ2ZZA/graph.json","events_json":"https://pith.science/api/pith-number/B7GZHCPI74GDXHBSERKDPZ2ZZA/events.json","paper":"https://pith.science/paper/B7GZHCPI"},"agent_actions":{"view_html":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA","download_json":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA.json","view_paper":"https://pith.science/paper/B7GZHCPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.04379&json=true","fetch_graph":"https://pith.science/api/pith-number/B7GZHCPI74GDXHBSERKDPZ2ZZA/graph.json","fetch_events":"https://pith.science/api/pith-number/B7GZHCPI74GDXHBSERKDPZ2ZZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA/action/storage_attestation","attest_author":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA/action/author_attestation","sign_citation":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA/action/citation_signature","submit_replication":"https://pith.science/pith/B7GZHCPI74GDXHBSERKDPZ2ZZA/action/replication_record"}},"created_at":"2026-05-18T00:03:40.304436+00:00","updated_at":"2026-05-18T00:03:40.304436+00:00"}