{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KISJFHEKPLXTTBGADHXKAISFQV","short_pith_number":"pith:KISJFHEK","canonical_record":{"source":{"id":"1908.09151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T15:17:27Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b2ca33c24a205e8e6c7c24abf463ebf1031c1fbe5b4a084773ed15595f3c695d","abstract_canon_sha256":"c55ab3b13c2483829631b7150c8f38161886d4c06695e060ba77d6a3c3d8878b"},"schema_version":"1.0"},"canonical_sha256":"5224929c8a7aef3984c019eea02245857974862d9d719443c3a1ef739e12e269","source":{"kind":"arxiv","id":"1908.09151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09151","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09151v1","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09151","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"KISJFHEKPLXT","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_16","alias_value":"KISJFHEKPLXTTBGA","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_8","alias_value":"KISJFHEK","created_at":"2026-07-04T23:59:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KISJFHEKPLXTTBGADHXKAISFQV","target":"record","payload":{"canonical_record":{"source":{"id":"1908.09151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T15:17:27Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b2ca33c24a205e8e6c7c24abf463ebf1031c1fbe5b4a084773ed15595f3c695d","abstract_canon_sha256":"c55ab3b13c2483829631b7150c8f38161886d4c06695e060ba77d6a3c3d8878b"},"schema_version":"1.0"},"canonical_sha256":"5224929c8a7aef3984c019eea02245857974862d9d719443c3a1ef739e12e269","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:37.255455Z","signature_b64":"YR+RsBGDoxBFAsnbHkaTtwETkYlWMTgAPpL/S5vsCIDZsLmDVw/M47uBqP9GigjWB4d09KiarzxhMuBrvakbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5224929c8a7aef3984c019eea02245857974862d9d719443c3a1ef739e12e269","last_reissued_at":"2026-07-04T23:59:37.254999Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:37.254999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.09151","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-07-04T23:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77wAqb3yF3IDm6eYKCHn61qaHNuY1LL5f30+Gfoz/yvlHQ/2dmfxvFBrr3WMBjNadrhr9sA69PZcxZuclkPuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:39:49.988944Z"},"content_sha256":"7dc256a86aed3f5ce40f2e5b93c27243c780d3460ea14d1e9b6c8b548af3de19","schema_version":"1.0","event_id":"sha256:7dc256a86aed3f5ce40f2e5b93c27243c780d3460ea14d1e9b6c8b548af3de19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KISJFHEKPLXTTBGADHXKAISFQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Circle Graph Isomorphism in Almost Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Pavel Klav\\'ik, Peter Zeman, V\\'it Kalisz","submitted_at":"2019-08-24T15:17:27Z","abstract_excerpt":"Circle graphs are intersection graphs of chords of a circle. In this paper, we present a new algorithm for the circle graph isomorphism problem running in time $O((n+m)\\alpha(n+m))$ where $n$ is the number of vertices, $m$ is the number of edges and $\\alpha$ is the inverse Ackermann function. Our algorithm is based on the minimal split decomposition [Cunnigham, 1982] and uses the state-of-art circle graph recognition algorithm [Gioan, Paul, Tedder, Corneil, 2014] in the same running time. It improves the running time $O(nm)$ of the previous algorithm [Hsu, 1995] based on a similar approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09151","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.09151/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:59:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MK79diOhYIVSUnXwI91ZdoSxSbWKumVXAQuZvpOe/+H9Q1/R3Vz+VcqkYyLHtNuzioKYiE5jw7PLXFg09hG1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:39:49.989503Z"},"content_sha256":"dd967a06f7835737612e8e9fa2a44c0b4acfc7166bc6ae60ca50a4ac90c770b9","schema_version":"1.0","event_id":"sha256:dd967a06f7835737612e8e9fa2a44c0b4acfc7166bc6ae60ca50a4ac90c770b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KISJFHEKPLXTTBGADHXKAISFQV/bundle.json","state_url":"https://pith.science/pith/KISJFHEKPLXTTBGADHXKAISFQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KISJFHEKPLXTTBGADHXKAISFQV/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-08-16T04:39:49Z","links":{"resolver":"https://pith.science/pith/KISJFHEKPLXTTBGADHXKAISFQV","bundle":"https://pith.science/pith/KISJFHEKPLXTTBGADHXKAISFQV/bundle.json","state":"https://pith.science/pith/KISJFHEKPLXTTBGADHXKAISFQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KISJFHEKPLXTTBGADHXKAISFQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KISJFHEKPLXTTBGADHXKAISFQV","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":"c55ab3b13c2483829631b7150c8f38161886d4c06695e060ba77d6a3c3d8878b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T15:17:27Z","title_canon_sha256":"b2ca33c24a205e8e6c7c24abf463ebf1031c1fbe5b4a084773ed15595f3c695d"},"schema_version":"1.0","source":{"id":"1908.09151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09151","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09151v1","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09151","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_12","alias_value":"KISJFHEKPLXT","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_16","alias_value":"KISJFHEKPLXTTBGA","created_at":"2026-07-04T23:59:37Z"},{"alias_kind":"pith_short_8","alias_value":"KISJFHEK","created_at":"2026-07-04T23:59:37Z"}],"graph_snapshots":[{"event_id":"sha256:dd967a06f7835737612e8e9fa2a44c0b4acfc7166bc6ae60ca50a4ac90c770b9","target":"graph","created_at":"2026-07-04T23:59:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.09151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Circle graphs are intersection graphs of chords of a circle. In this paper, we present a new algorithm for the circle graph isomorphism problem running in time $O((n+m)\\alpha(n+m))$ where $n$ is the number of vertices, $m$ is the number of edges and $\\alpha$ is the inverse Ackermann function. Our algorithm is based on the minimal split decomposition [Cunnigham, 1982] and uses the state-of-art circle graph recognition algorithm [Gioan, Paul, Tedder, Corneil, 2014] in the same running time. It improves the running time $O(nm)$ of the previous algorithm [Hsu, 1995] based on a similar approach.","authors_text":"Pavel Klav\\'ik, Peter Zeman, V\\'it Kalisz","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T15:17:27Z","title":"Circle Graph Isomorphism in Almost Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09151","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:7dc256a86aed3f5ce40f2e5b93c27243c780d3460ea14d1e9b6c8b548af3de19","target":"record","created_at":"2026-07-04T23:59:37Z","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":"c55ab3b13c2483829631b7150c8f38161886d4c06695e060ba77d6a3c3d8878b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-24T15:17:27Z","title_canon_sha256":"b2ca33c24a205e8e6c7c24abf463ebf1031c1fbe5b4a084773ed15595f3c695d"},"schema_version":"1.0","source":{"id":"1908.09151","kind":"arxiv","version":1}},"canonical_sha256":"5224929c8a7aef3984c019eea02245857974862d9d719443c3a1ef739e12e269","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5224929c8a7aef3984c019eea02245857974862d9d719443c3a1ef739e12e269","first_computed_at":"2026-07-04T23:59:37.254999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:37.254999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YR+RsBGDoxBFAsnbHkaTtwETkYlWMTgAPpL/S5vsCIDZsLmDVw/M47uBqP9GigjWB4d09KiarzxhMuBrvakbBw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:37.255455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dc256a86aed3f5ce40f2e5b93c27243c780d3460ea14d1e9b6c8b548af3de19","sha256:dd967a06f7835737612e8e9fa2a44c0b4acfc7166bc6ae60ca50a4ac90c770b9"],"state_sha256":"ff5626d872370aa82993eedf8c513fdbd06d894fe06758499fdb4c65cff4e07d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AaafhfnqGk5/Mcl6cjmgOIvg4FmJAVBt7GSFYyksrRe9Xc6f01iEE44MP8akRjTFHnL0jn6t6umG2aReMjo+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:39:49.994385Z","bundle_sha256":"52499f160ecc9243453b1ca91808e993773b8763607716eb2d90209bdf0cba7a"}}