{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EK6S5HK4YP7W7SFKPAN47EZUDG","short_pith_number":"pith:EK6S5HK4","canonical_record":{"source":{"id":"1509.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-19T00:06:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"66618b27a612a4a64ca5dee08b89ead63335bf59704d987c5e45349d1b2cfe54","abstract_canon_sha256":"4fa2077857f84d1c0dc36cb2b41d99e81a14e2e13b39a2bd55db84333c18511c"},"schema_version":"1.0"},"canonical_sha256":"22bd2e9d5cc3ff6fc8aa781bcf9334199e7e9cbed4b94c3e1b1a628ea71a1622","source":{"kind":"arxiv","id":"1509.05828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05828","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05828v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05828","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"EK6S5HK4YP7W","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EK6S5HK4YP7W7SFK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EK6S5HK4","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EK6S5HK4YP7W7SFKPAN47EZUDG","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-19T00:06:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"66618b27a612a4a64ca5dee08b89ead63335bf59704d987c5e45349d1b2cfe54","abstract_canon_sha256":"4fa2077857f84d1c0dc36cb2b41d99e81a14e2e13b39a2bd55db84333c18511c"},"schema_version":"1.0"},"canonical_sha256":"22bd2e9d5cc3ff6fc8aa781bcf9334199e7e9cbed4b94c3e1b1a628ea71a1622","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.230250Z","signature_b64":"oY+Nz4gLJP9jcGurOsnSiLqqMJkCKppLrApfbN8CjzSem2ki9+2jQlWJiFgpmhoYGWLi/5CS/PFfer68sUUwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22bd2e9d5cc3ff6fc8aa781bcf9334199e7e9cbed4b94c3e1b1a628ea71a1622","last_reissued_at":"2026-05-18T01:32:42.229343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.229343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05828","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OYriYkwnYH/67cGSdCSmt0sG6meeRpQqFXgAniQ3Ovm8QkDf/h8jKB2u5D16Iv4Mn/WCptnuLVNphZiiksAaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:33:41.576408Z"},"content_sha256":"8726bcecdd62293a38010f861d6d6054c0b7c1f359830272c635ff836c142665","schema_version":"1.0","event_id":"sha256:8726bcecdd62293a38010f861d6d6054c0b7c1f359830272c635ff836c142665"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EK6S5HK4YP7W7SFKPAN47EZUDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A certifying and dynamic algorithm for the recognition of proper circular-arc graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Francisco J. Soulignac","submitted_at":"2015-09-19T00:06:19Z","abstract_excerpt":"We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost $O(\\log n + d)$ time, where $n$ is the number vertices and $d$ is the degree of the modified vertex. When removals are disallowed, each insertion is processed in $O(d)$ time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Hell"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05828","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-18T01:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEqu8NQrxpAccxNJ8GeyxT2Qq2Qc/ipBW/DTnN9TEvmMsP8LT7Wb7NwTf8GDz/CVmc49XtxBZB0xkhEdeOHVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:33:41.576753Z"},"content_sha256":"8fb01f08a8aeeb9818889f7dcbb8119b6126cf81735e6b375389db14ec8c2635","schema_version":"1.0","event_id":"sha256:8fb01f08a8aeeb9818889f7dcbb8119b6126cf81735e6b375389db14ec8c2635"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EK6S5HK4YP7W7SFKPAN47EZUDG/bundle.json","state_url":"https://pith.science/pith/EK6S5HK4YP7W7SFKPAN47EZUDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EK6S5HK4YP7W7SFKPAN47EZUDG/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-06T20:33:41Z","links":{"resolver":"https://pith.science/pith/EK6S5HK4YP7W7SFKPAN47EZUDG","bundle":"https://pith.science/pith/EK6S5HK4YP7W7SFKPAN47EZUDG/bundle.json","state":"https://pith.science/pith/EK6S5HK4YP7W7SFKPAN47EZUDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EK6S5HK4YP7W7SFKPAN47EZUDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EK6S5HK4YP7W7SFKPAN47EZUDG","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":"4fa2077857f84d1c0dc36cb2b41d99e81a14e2e13b39a2bd55db84333c18511c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-19T00:06:19Z","title_canon_sha256":"66618b27a612a4a64ca5dee08b89ead63335bf59704d987c5e45349d1b2cfe54"},"schema_version":"1.0","source":{"id":"1509.05828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05828","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05828v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05828","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"EK6S5HK4YP7W","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EK6S5HK4YP7W7SFK","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EK6S5HK4","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:8fb01f08a8aeeb9818889f7dcbb8119b6126cf81735e6b375389db14ec8c2635","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"We present a dynamic algorithm for the recognition of proper circular-arc (PCA) graphs, that supports the insertion and removal of vertices (together with its incident edges). The main feature of the algorithm is that it outputs a minimally non-PCA induced subgraph when the insertion of a vertex fails. Each operation cost $O(\\log n + d)$ time, where $n$ is the number vertices and $d$ is the degree of the modified vertex. When removals are disallowed, each insertion is processed in $O(d)$ time. The algorithm also provides two constant-time operations to query if the dynamic graph is proper Hell","authors_text":"Francisco J. Soulignac","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-19T00:06:19Z","title":"A certifying and dynamic algorithm for the recognition of proper circular-arc graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05828","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:8726bcecdd62293a38010f861d6d6054c0b7c1f359830272c635ff836c142665","target":"record","created_at":"2026-05-18T01:32:42Z","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":"4fa2077857f84d1c0dc36cb2b41d99e81a14e2e13b39a2bd55db84333c18511c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-19T00:06:19Z","title_canon_sha256":"66618b27a612a4a64ca5dee08b89ead63335bf59704d987c5e45349d1b2cfe54"},"schema_version":"1.0","source":{"id":"1509.05828","kind":"arxiv","version":1}},"canonical_sha256":"22bd2e9d5cc3ff6fc8aa781bcf9334199e7e9cbed4b94c3e1b1a628ea71a1622","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22bd2e9d5cc3ff6fc8aa781bcf9334199e7e9cbed4b94c3e1b1a628ea71a1622","first_computed_at":"2026-05-18T01:32:42.229343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.229343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oY+Nz4gLJP9jcGurOsnSiLqqMJkCKppLrApfbN8CjzSem2ki9+2jQlWJiFgpmhoYGWLi/5CS/PFfer68sUUwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.230250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8726bcecdd62293a38010f861d6d6054c0b7c1f359830272c635ff836c142665","sha256:8fb01f08a8aeeb9818889f7dcbb8119b6126cf81735e6b375389db14ec8c2635"],"state_sha256":"5107358e9dd4a359a3325ef6855327787b748a180b894eb65780990923fb76e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKx2V3uUWT4VasuI+S6qUAc2ljaeCl0p3rWq7qSATY+dDCh6himMjxvDNxwc310JVVEPPiS1dCZGy97VacvLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:33:41.578873Z","bundle_sha256":"dd9eff3213765e9a71579f7b2fd4ca8a8828887457484daf4d8057ff4638c972"}}