{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ODAHQAERSISGEHLGOHIDV6BGJH","short_pith_number":"pith:ODAHQAER","canonical_record":{"source":{"id":"1402.2641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T20:46:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"77fa0b63abb426f79c3961a629cce628ffe12c2f3bbba4cef1359f3b8785b6fd","abstract_canon_sha256":"ec3e2cfef18a0ab72cf0227936b17aeec75c439d98f9c1056e20f0b46012f496"},"schema_version":"1.0"},"canonical_sha256":"70c07800919224621d6671d03af82649d2743ef052ee219755c326ee4ffd0337","source":{"kind":"arxiv","id":"1402.2641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2641","created_at":"2026-05-18T02:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2641v1","created_at":"2026-05-18T02:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2641","created_at":"2026-05-18T02:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"ODAHQAERSISG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ODAHQAERSISGEHLG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ODAHQAER","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ODAHQAERSISGEHLGOHIDV6BGJH","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T20:46:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"77fa0b63abb426f79c3961a629cce628ffe12c2f3bbba4cef1359f3b8785b6fd","abstract_canon_sha256":"ec3e2cfef18a0ab72cf0227936b17aeec75c439d98f9c1056e20f0b46012f496"},"schema_version":"1.0"},"canonical_sha256":"70c07800919224621d6671d03af82649d2743ef052ee219755c326ee4ffd0337","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:18.998691Z","signature_b64":"96fQOQyElq+/87+io9jH7lRQyF6V6VfQmBk4ueN/gsr681TYXUYiJrtSVOl2HAef1ReX7WKI+OSp7GRphZDzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c07800919224621d6671d03af82649d2743ef052ee219755c326ee4ffd0337","last_reissued_at":"2026-05-18T02:59:18.998045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:18.998045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2641","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:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ZRJs3w4+3Y2+MGAnEdGhs/f1vd2VK7ZZlhAmYHsgtvXou0DABdiR7frEGLUhxbEGRE+3fUNYtGJqRn/jmG/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:08:00.617804Z"},"content_sha256":"f0935b77cf5fdf7316836f41582b733d6af8f5e79731960a2e2c2f255e9ff8c6","schema_version":"1.0","event_id":"sha256:f0935b77cf5fdf7316836f41582b733d6af8f5e79731960a2e2c2f255e9ff8c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ODAHQAERSISGEHLGOHIDV6BGJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On circular-arc graphs having a model with no three arcs covering the circle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Luciano N. Grippo, Mart\\'in D. Safe","submitted_at":"2014-02-11T20:46:22Z","abstract_excerpt":"An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval graphs was found fifty years ago, finding an analogous characterization for circular-arc graphs is a long-standing open problem. In this work, we study the intersection graphs of finite sets of arcs on a circle no three of which cover the circle, known as normal Helly circular-arc graphs. Those circular-arc graphs which are minimal forbidden induced subgraphs for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2641","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:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rDdeDhH2aYceShypKwhIAQ+36GdnfxuUenRGfM6hHVUYDO6Wm4Kk+NnkBdQd+Zfp6MafmOqkQUVEUKzjXaJNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:08:00.618141Z"},"content_sha256":"25b6c58cf7b657581fb10bc8128128a4579a07b165a96b5dddbb45cc6cd09910","schema_version":"1.0","event_id":"sha256:25b6c58cf7b657581fb10bc8128128a4579a07b165a96b5dddbb45cc6cd09910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODAHQAERSISGEHLGOHIDV6BGJH/bundle.json","state_url":"https://pith.science/pith/ODAHQAERSISGEHLGOHIDV6BGJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODAHQAERSISGEHLGOHIDV6BGJH/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-24T17:08:00Z","links":{"resolver":"https://pith.science/pith/ODAHQAERSISGEHLGOHIDV6BGJH","bundle":"https://pith.science/pith/ODAHQAERSISGEHLGOHIDV6BGJH/bundle.json","state":"https://pith.science/pith/ODAHQAERSISGEHLGOHIDV6BGJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODAHQAERSISGEHLGOHIDV6BGJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ODAHQAERSISGEHLGOHIDV6BGJH","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":"ec3e2cfef18a0ab72cf0227936b17aeec75c439d98f9c1056e20f0b46012f496","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T20:46:22Z","title_canon_sha256":"77fa0b63abb426f79c3961a629cce628ffe12c2f3bbba4cef1359f3b8785b6fd"},"schema_version":"1.0","source":{"id":"1402.2641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2641","created_at":"2026-05-18T02:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2641v1","created_at":"2026-05-18T02:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2641","created_at":"2026-05-18T02:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"ODAHQAERSISG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ODAHQAERSISGEHLG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ODAHQAER","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:25b6c58cf7b657581fb10bc8128128a4579a07b165a96b5dddbb45cc6cd09910","target":"graph","created_at":"2026-05-18T02:59:18Z","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":"An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval graphs was found fifty years ago, finding an analogous characterization for circular-arc graphs is a long-standing open problem. In this work, we study the intersection graphs of finite sets of arcs on a circle no three of which cover the circle, known as normal Helly circular-arc graphs. Those circular-arc graphs which are minimal forbidden induced subgraphs for","authors_text":"Luciano N. Grippo, Mart\\'in D. Safe","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T20:46:22Z","title":"On circular-arc graphs having a model with no three arcs covering the circle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2641","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:f0935b77cf5fdf7316836f41582b733d6af8f5e79731960a2e2c2f255e9ff8c6","target":"record","created_at":"2026-05-18T02:59:18Z","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":"ec3e2cfef18a0ab72cf0227936b17aeec75c439d98f9c1056e20f0b46012f496","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-02-11T20:46:22Z","title_canon_sha256":"77fa0b63abb426f79c3961a629cce628ffe12c2f3bbba4cef1359f3b8785b6fd"},"schema_version":"1.0","source":{"id":"1402.2641","kind":"arxiv","version":1}},"canonical_sha256":"70c07800919224621d6671d03af82649d2743ef052ee219755c326ee4ffd0337","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70c07800919224621d6671d03af82649d2743ef052ee219755c326ee4ffd0337","first_computed_at":"2026-05-18T02:59:18.998045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:18.998045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96fQOQyElq+/87+io9jH7lRQyF6V6VfQmBk4ueN/gsr681TYXUYiJrtSVOl2HAef1ReX7WKI+OSp7GRphZDzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:18.998691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0935b77cf5fdf7316836f41582b733d6af8f5e79731960a2e2c2f255e9ff8c6","sha256:25b6c58cf7b657581fb10bc8128128a4579a07b165a96b5dddbb45cc6cd09910"],"state_sha256":"a465008bf1fd7ab06315ebb96b989c4b3c75c6b4a223df7f0c04df33962cc3d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZEB/GqvqsYkfktcvKVwjnyDHZAwpb0P199jPjGC1F5fjkhIkJajNtOEb6UCc8c9rahOXkIo3ztcXG7+TuaRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:08:00.620107Z","bundle_sha256":"386609f7dd6d0199a2a687ba2fe45610737e22ae7443cd01f179aacfecd19a43"}}