{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LSDTEEQVULJHLGG4LZC255UUU6","short_pith_number":"pith:LSDTEEQV","canonical_record":{"source":{"id":"1402.4642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-19T12:32:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"34ead7d6f6f5677e96b893688aad3b8b1e3690d24624aeca3d47e25092f0cbcd","abstract_canon_sha256":"d7ccf5361550bbd2131e1bfe866451d6922794841020cf8360b5a65ec2ef064b"},"schema_version":"1.0"},"canonical_sha256":"5c87321215a2d27598dc5e45aef694a78e6dadd5c2c78d8ff2d832cb4e2b5982","source":{"kind":"arxiv","id":"1402.4642","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4642","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4642v2","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4642","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"LSDTEEQVULJH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LSDTEEQVULJHLGG4","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LSDTEEQV","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LSDTEEQVULJHLGG4LZC255UUU6","target":"record","payload":{"canonical_record":{"source":{"id":"1402.4642","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-19T12:32:59Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"34ead7d6f6f5677e96b893688aad3b8b1e3690d24624aeca3d47e25092f0cbcd","abstract_canon_sha256":"d7ccf5361550bbd2131e1bfe866451d6922794841020cf8360b5a65ec2ef064b"},"schema_version":"1.0"},"canonical_sha256":"5c87321215a2d27598dc5e45aef694a78e6dadd5c2c78d8ff2d832cb4e2b5982","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:08.596901Z","signature_b64":"+CT0wptryhDr3IICT/CSrvAYVH+BincTgEb4PCR5I2Qt5/MixZ6+t0d35L8MylkZ/xWdgObI3P3Gj/NmtZBoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c87321215a2d27598dc5e45aef694a78e6dadd5c2c78d8ff2d832cb4e2b5982","last_reissued_at":"2026-05-18T00:46:08.596439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:08.596439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.4642","source_version":2,"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-18T00:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQL96l61sDk5gGkKqmAHNrPj2ETgFfo1/1j2zV4mOBEuj9ALdugFHvSATS4O+zUDNLVULJGpRkMPeSn28kpkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:29:46.814033Z"},"content_sha256":"d83511546563e0439c64b5795ef8ed1dafbd8fff549fe6ebb4ff1b506e79d462","schema_version":"1.0","event_id":"sha256:d83511546563e0439c64b5795ef8ed1dafbd8fff549fe6ebb4ff1b506e79d462"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LSDTEEQVULJHLGG4LZC255UUU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Isomorphism Problem for Helly Circular-Arc Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Johannes K\\\"obler, Oleg Verbitsky, Sebastian Kuhnert","submitted_at":"2014-02-19T12:32:59Z","abstract_excerpt":"The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of circular arcs that satisfy the Helly property. We solve the isomorphism problem for this class in logarithmic space. If an input graph has a Helly circular-arc model, our algorithm constructs it canonically, which means that the models constructed for isomorphic graphs are equal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4642","kind":"arxiv","version":2},"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-18T00:46:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4aGKrgNOAgS3KSzAHXmjvBdWrG2eQApSrmwvuP7V+PH6s2VLGvZ1TJiBi9S9v3VTOIOJfpTu+DvZ6YyAUK/2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:29:46.814829Z"},"content_sha256":"153d98142258ed867dbd3d30d4bc69e49aef91213baf630bd18a63dd9c2b874e","schema_version":"1.0","event_id":"sha256:153d98142258ed867dbd3d30d4bc69e49aef91213baf630bd18a63dd9c2b874e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSDTEEQVULJHLGG4LZC255UUU6/bundle.json","state_url":"https://pith.science/pith/LSDTEEQVULJHLGG4LZC255UUU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSDTEEQVULJHLGG4LZC255UUU6/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-05-25T08:29:46Z","links":{"resolver":"https://pith.science/pith/LSDTEEQVULJHLGG4LZC255UUU6","bundle":"https://pith.science/pith/LSDTEEQVULJHLGG4LZC255UUU6/bundle.json","state":"https://pith.science/pith/LSDTEEQVULJHLGG4LZC255UUU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSDTEEQVULJHLGG4LZC255UUU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LSDTEEQVULJHLGG4LZC255UUU6","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":"d7ccf5361550bbd2131e1bfe866451d6922794841020cf8360b5a65ec2ef064b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-19T12:32:59Z","title_canon_sha256":"34ead7d6f6f5677e96b893688aad3b8b1e3690d24624aeca3d47e25092f0cbcd"},"schema_version":"1.0","source":{"id":"1402.4642","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4642","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4642v2","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4642","created_at":"2026-05-18T00:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"LSDTEEQVULJH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LSDTEEQVULJHLGG4","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LSDTEEQV","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:153d98142258ed867dbd3d30d4bc69e49aef91213baf630bd18a63dd9c2b874e","target":"graph","created_at":"2026-05-18T00:46:08Z","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":"The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of circular arcs that satisfy the Helly property. We solve the isomorphism problem for this class in logarithmic space. If an input graph has a Helly circular-arc model, our algorithm constructs it canonically, which means that the models constructed for isomorphic graphs are equal.","authors_text":"Johannes K\\\"obler, Oleg Verbitsky, Sebastian Kuhnert","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-19T12:32:59Z","title":"On the Isomorphism Problem for Helly Circular-Arc Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4642","kind":"arxiv","version":2},"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:d83511546563e0439c64b5795ef8ed1dafbd8fff549fe6ebb4ff1b506e79d462","target":"record","created_at":"2026-05-18T00:46:08Z","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":"d7ccf5361550bbd2131e1bfe866451d6922794841020cf8360b5a65ec2ef064b","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-02-19T12:32:59Z","title_canon_sha256":"34ead7d6f6f5677e96b893688aad3b8b1e3690d24624aeca3d47e25092f0cbcd"},"schema_version":"1.0","source":{"id":"1402.4642","kind":"arxiv","version":2}},"canonical_sha256":"5c87321215a2d27598dc5e45aef694a78e6dadd5c2c78d8ff2d832cb4e2b5982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c87321215a2d27598dc5e45aef694a78e6dadd5c2c78d8ff2d832cb4e2b5982","first_computed_at":"2026-05-18T00:46:08.596439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:08.596439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+CT0wptryhDr3IICT/CSrvAYVH+BincTgEb4PCR5I2Qt5/MixZ6+t0d35L8MylkZ/xWdgObI3P3Gj/NmtZBoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:08.596901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4642","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d83511546563e0439c64b5795ef8ed1dafbd8fff549fe6ebb4ff1b506e79d462","sha256:153d98142258ed867dbd3d30d4bc69e49aef91213baf630bd18a63dd9c2b874e"],"state_sha256":"24f7ca7acaa1b4f136194fe7c44e058ba673a0c6ca407e909b95f240d14f8b84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkHKCO7alIaEfDrJBZ4PrADVw8hZKPsSir1MMtjQ6bC/dSZsK4pvF+w/369bnEFVG09EK4QPE16Zh0DxX22CBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:29:46.818927Z","bundle_sha256":"6839a4fd6c267200a2f89c203f360b50fa12a376903ba74631c73caa673beef0"}}