{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6S36XXZMHLL53E6YTHRRW3XABX","short_pith_number":"pith:6S36XXZM","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"},"canonical_sha256":"f4b7ebdf2c3ad7dd93d899e31b6ee00decb4f9e95ab27f8e74caf88e140b1de5","source":{"kind":"arxiv","id":"1408.2639","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2639","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2639v1","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2639","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"6S36XXZMHLL5","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6S36XXZMHLL53E6Y","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6S36XXZM","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6S36XXZMHLL53E6YTHRRW3XABX","target":"record","payload":{"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"},"canonical_sha256":"f4b7ebdf2c3ad7dd93d899e31b6ee00decb4f9e95ab27f8e74caf88e140b1de5","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"},"source_kind":"arxiv","source_id":"1408.2639","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4jloVkkJFUbzoe9H+LsbLPiNPFhhhIBj138SX3Xhe8CRJ7W1ajdGVmw06oGh0WU/zldiI4ZUvdWAbZSUIXgaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:20:11.039006Z"},"content_sha256":"9bd709e6ec57b0a0d340084357714bc658481ffe503c523bc58f4450a4c60a58","schema_version":"1.0","event_id":"sha256:9bd709e6ec57b0a0d340084357714bc658481ffe503c523bc58f4450a4c60a58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6S36XXZMHLL53E6YTHRRW3XABX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiUgryFZ24QC7MBK8He5FlMTkh5oh9n4PP70agIU1MXW2JQSy3nQqyIHGkzxumr/7QUkfs59myzo9ocDDCjrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:20:11.039369Z"},"content_sha256":"2124e90440fcd34158014b3635ef8b7f14bb9d02acfe479150fef0384b6ab623","schema_version":"1.0","event_id":"sha256:2124e90440fcd34158014b3635ef8b7f14bb9d02acfe479150fef0384b6ab623"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/bundle.json","state_url":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6S36XXZMHLL53E6YTHRRW3XABX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T01:20:11Z","links":{"resolver":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX","bundle":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/bundle.json","state":"https://pith.science/pith/6S36XXZMHLL53E6YTHRRW3XABX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6S36XXZMHLL53E6YTHRRW3XABX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6S36XXZMHLL53E6YTHRRW3XABX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b9a6ea48951d3feae51b6d64eed52db71242d9a10c49e14d5954ca006f68d94f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-12T07:11:46Z","title_canon_sha256":"0f96a2f342f0496639744226e98c31fc64b25825be1f5f29f29e9f0a39739afd"},"schema_version":"1.0","source":{"id":"1408.2639","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2639","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2639v1","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2639","created_at":"2026-05-18T02:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"6S36XXZMHLL5","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6S36XXZMHLL53E6Y","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6S36XXZM","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2124e90440fcd34158014b3635ef8b7f14bb9d02acfe479150fef0384b6ab623","target":"graph","created_at":"2026-05-18T02:45:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Juraj Stacho, Mathew Francis, Pavol Hell","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-12T07:11:46Z","title":"Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2639","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9bd709e6ec57b0a0d340084357714bc658481ffe503c523bc58f4450a4c60a58","target":"record","created_at":"2026-05-18T02:45:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b9a6ea48951d3feae51b6d64eed52db71242d9a10c49e14d5954ca006f68d94f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-08-12T07:11:46Z","title_canon_sha256":"0f96a2f342f0496639744226e98c31fc64b25825be1f5f29f29e9f0a39739afd"},"schema_version":"1.0","source":{"id":"1408.2639","kind":"arxiv","version":1}},"canonical_sha256":"f4b7ebdf2c3ad7dd93d899e31b6ee00decb4f9e95ab27f8e74caf88e140b1de5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4b7ebdf2c3ad7dd93d899e31b6ee00decb4f9e95ab27f8e74caf88e140b1de5","first_computed_at":"2026-05-18T02:45:22.614803Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:22.614803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A/fzL5eM/0YK/8kKYJ4cBNyK/6z5K4PDdZNYtAsp47+Zf69lG5Aw2Gboiep23LbGoFwR22Imjvm5z6X7ld3XAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:22.615271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2639","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd709e6ec57b0a0d340084357714bc658481ffe503c523bc58f4450a4c60a58","sha256:2124e90440fcd34158014b3635ef8b7f14bb9d02acfe479150fef0384b6ab623"],"state_sha256":"b916d99f2b9e3846a80533ae60bcaf9e01def27036ae4ab9f78a99e33beebef4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hOI4ehzUbW1a3TTXDDstZlRQLpUR39fM0/AbAgbxeiocLaUYBVdOIVhhXSdHFTEH146SwivQqeZtoGSWs/unDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:20:11.041348Z","bundle_sha256":"f506f075bdf7b6857adcc17e26301fd15defb510cd62f63bb965ef8713e60462"}}