{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I5GPIFYD6GVO7EEFN6NPADKSVR","short_pith_number":"pith:I5GPIFYD","schema_version":"1.0","canonical_sha256":"474cf41703f1aaef90856f9af00d52ac6be73fd2ccda9660a62f607654bff94e","source":{"kind":"arxiv","id":"1907.00351","version":1},"attestation_state":"computed","paper":{"title":"A Note on Graphs of Dichromatic Number 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Steiner","submitted_at":"2019-06-30T10:06:42Z","abstract_excerpt":"Neumann-Lara and \\v{S}krekovski conjectured that every planar digraph is $2$-colourable. We show that this conjecture is equivalent to the more general statement that all oriented $K_5$-minor-free graphs are $2$-colourable."},"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":"1907.00351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-30T10:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"427b1111fa427d37088091f2fb3d9b41fccf959cc9eb333f0f1e48ba0ab4c032","abstract_canon_sha256":"108b414369ffff39e8feba88eedfb7c3d241e2dbb1e1f462a9aa0378ac58d905"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:52.051824Z","signature_b64":"niovHINPR6nXUO06I5YmAqFhpW1ejNnjrcW/80bZHUoSYxGwaAJfDx2SuWW/tyQdpzWPGZo9PSnVAcL/7w42Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"474cf41703f1aaef90856f9af00d52ac6be73fd2ccda9660a62f607654bff94e","last_reissued_at":"2026-05-17T23:41:52.051127Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:52.051127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Graphs of Dichromatic Number 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Steiner","submitted_at":"2019-06-30T10:06:42Z","abstract_excerpt":"Neumann-Lara and \\v{S}krekovski conjectured that every planar digraph is $2$-colourable. We show that this conjecture is equivalent to the more general statement that all oriented $K_5$-minor-free graphs are $2$-colourable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00351","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":"1907.00351","created_at":"2026-05-17T23:41:52.051234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00351v1","created_at":"2026-05-17T23:41:52.051234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00351","created_at":"2026-05-17T23:41:52.051234+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5GPIFYD6GVO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5GPIFYD6GVO7EEF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5GPIFYD","created_at":"2026-05-18T12:33:18.533446+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/I5GPIFYD6GVO7EEFN6NPADKSVR","json":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR.json","graph_json":"https://pith.science/api/pith-number/I5GPIFYD6GVO7EEFN6NPADKSVR/graph.json","events_json":"https://pith.science/api/pith-number/I5GPIFYD6GVO7EEFN6NPADKSVR/events.json","paper":"https://pith.science/paper/I5GPIFYD"},"agent_actions":{"view_html":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR","download_json":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR.json","view_paper":"https://pith.science/paper/I5GPIFYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00351&json=true","fetch_graph":"https://pith.science/api/pith-number/I5GPIFYD6GVO7EEFN6NPADKSVR/graph.json","fetch_events":"https://pith.science/api/pith-number/I5GPIFYD6GVO7EEFN6NPADKSVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR/action/storage_attestation","attest_author":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR/action/author_attestation","sign_citation":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR/action/citation_signature","submit_replication":"https://pith.science/pith/I5GPIFYD6GVO7EEFN6NPADKSVR/action/replication_record"}},"created_at":"2026-05-17T23:41:52.051234+00:00","updated_at":"2026-05-17T23:41:52.051234+00:00"}