{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YQ6T4ZDOETWPOYHYXBBYPCE4V3","short_pith_number":"pith:YQ6T4ZDO","schema_version":"1.0","canonical_sha256":"c43d3e646e24ecf760f8b84387889caefe3b0bd8742dc608f288f1291ebb4181","source":{"kind":"arxiv","id":"1710.03524","version":1},"attestation_state":"computed","paper":{"title":"The Overfull Conjecture on Split-Comparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\^andida Nunes da Silva, Jadder Bismarck de Sousa Cruz, Sheila Morais de Almeida","submitted_at":"2017-10-10T11:44:37Z","abstract_excerpt":"We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability 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":"1710.03524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-10T11:44:37Z","cross_cats_sorted":[],"title_canon_sha256":"9b296ebc940599ff7f59c4ab0eb2337283cd0478c6f86cad1b0caf767b7b7c32","abstract_canon_sha256":"ac58259a20b27ad091e625942c18cc9ad6214da2e5b2ce2a467d14add5b88120"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:11.595459Z","signature_b64":"wc2EyE7pMA3TZrh2JdIkSaauu75BezSxm7HgxpovcArUkXDgiq40wdXTGZnuxkn5jYOwOSL9IctKTdxFPG7HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c43d3e646e24ecf760f8b84387889caefe3b0bd8742dc608f288f1291ebb4181","last_reissued_at":"2026-05-18T00:33:11.594883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:11.594883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Overfull Conjecture on Split-Comparability Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C\\^andida Nunes da Silva, Jadder Bismarck de Sousa Cruz, Sheila Morais de Almeida","submitted_at":"2017-10-10T11:44:37Z","abstract_excerpt":"We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03524","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":"1710.03524","created_at":"2026-05-18T00:33:11.594966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.03524v1","created_at":"2026-05-18T00:33:11.594966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03524","created_at":"2026-05-18T00:33:11.594966+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQ6T4ZDOETWP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQ6T4ZDOETWPOYHY","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQ6T4ZDO","created_at":"2026-05-18T12:31:56.362134+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/YQ6T4ZDOETWPOYHYXBBYPCE4V3","json":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3.json","graph_json":"https://pith.science/api/pith-number/YQ6T4ZDOETWPOYHYXBBYPCE4V3/graph.json","events_json":"https://pith.science/api/pith-number/YQ6T4ZDOETWPOYHYXBBYPCE4V3/events.json","paper":"https://pith.science/paper/YQ6T4ZDO"},"agent_actions":{"view_html":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3","download_json":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3.json","view_paper":"https://pith.science/paper/YQ6T4ZDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.03524&json=true","fetch_graph":"https://pith.science/api/pith-number/YQ6T4ZDOETWPOYHYXBBYPCE4V3/graph.json","fetch_events":"https://pith.science/api/pith-number/YQ6T4ZDOETWPOYHYXBBYPCE4V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3/action/storage_attestation","attest_author":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3/action/author_attestation","sign_citation":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3/action/citation_signature","submit_replication":"https://pith.science/pith/YQ6T4ZDOETWPOYHYXBBYPCE4V3/action/replication_record"}},"created_at":"2026-05-18T00:33:11.594966+00:00","updated_at":"2026-05-18T00:33:11.594966+00:00"}