{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6S36XXZMHLL53E6YTHRRW3XABX","short_pith_number":"pith:6S36XXZM","schema_version":"1.0","canonical_sha256":"f4b7ebdf2c3ad7dd93d899e31b6ee00decb4f9e95ab27f8e74caf88e140b1de5","source":{"kind":"arxiv","id":"1408.2639","version":1},"attestation_state":"computed","paper":{"title":"Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Juraj Stacho, Mathew Francis, Pavol Hell","submitted_at":"2014-08-12T07:11:46Z","abstract_excerpt":"A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that outputs a certificate, along with its answer (be it positive or negative), where the certificate can be used to easily justify the given answer. While the recognition of circular-arc graphs has been known to be polynomial since the 1980s, no polynomial-time certifying recognition algorithm is known to date, despite such algorithms being found for many subclasses of circular-arc graphs. This is largely due to the fac"},"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":"1408.2639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-12T07:11:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0f96a2f342f0496639744226e98c31fc64b25825be1f5f29f29e9f0a39739afd","abstract_canon_sha256":"b9a6ea48951d3feae51b6d64eed52db71242d9a10c49e14d5954ca006f68d94f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.615271Z","signature_b64":"A/fzL5eM/0YK/8kKYJ4cBNyK/6z5K4PDdZNYtAsp47+Zf69lG5Aw2Gboiep23LbGoFwR22Imjvm5z6X7ld3XAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4b7ebdf2c3ad7dd93d899e31b6ee00decb4f9e95ab27f8e74caf88e140b1de5","last_reissued_at":"2026-05-18T02:45:22.614803Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.614803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Juraj Stacho, Mathew Francis, Pavol Hell","submitted_at":"2014-08-12T07:11:46Z","abstract_excerpt":"A circular-arc graph is the intersection graph of arcs of a circle. It is a well-studied graph model with numerous natural applications. A certifying algorithm is an algorithm that outputs a certificate, along with its answer (be it positive or negative), where the certificate can be used to easily justify the given answer. While the recognition of circular-arc graphs has been known to be polynomial since the 1980s, no polynomial-time certifying recognition algorithm is known to date, despite such algorithms being found for many subclasses of circular-arc graphs. This is largely due to the fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2639","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":"1408.2639","created_at":"2026-05-18T02:45:22.614875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2639v1","created_at":"2026-05-18T02:45:22.614875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2639","created_at":"2026-05-18T02:45:22.614875+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S36XXZMHLL5","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S36XXZMHLL53E6Y","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S36XXZM","created_at":"2026-05-18T12:28:16.859392+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/6S36XXZMHLL53E6YTHRRW3XABX","json":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX.json","graph_json":"https://pith.science/api/pith-number/6S36XXZMHLL53E6YTHRRW3XABX/graph.json","events_json":"https://pith.science/api/pith-number/6S36XXZMHLL53E6YTHRRW3XABX/events.json","paper":"https://pith.science/paper/6S36XXZM"},"agent_actions":{"view_html":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX","download_json":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX.json","view_paper":"https://pith.science/paper/6S36XXZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2639&json=true","fetch_graph":"https://pith.science/api/pith-number/6S36XXZMHLL53E6YTHRRW3XABX/graph.json","fetch_events":"https://pith.science/api/pith-number/6S36XXZMHLL53E6YTHRRW3XABX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/action/storage_attestation","attest_author":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/action/author_attestation","sign_citation":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/action/citation_signature","submit_replication":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/action/replication_record"}},"created_at":"2026-05-18T02:45:22.614875+00:00","updated_at":"2026-05-18T02:45:22.614875+00:00"}