{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ECVQ5BA7KXWJGWMJN373SSRBBO","short_pith_number":"pith:ECVQ5BA7","canonical_record":{"source":{"id":"1903.11062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-26T10:03:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e330e3ed4f61486e884c7a59ca2ff3d28c7d6b64e7a80f033a1bfd62aacc242f","abstract_canon_sha256":"b70e07725d5168d95c0d090d9baa70867a6ee6ebc47bef10a80f0c7faca71d03"},"schema_version":"1.0"},"canonical_sha256":"20ab0e841f55ec9359896effb94a210b8eb38b128b1b62ac3f21f02b17fcb4e3","source":{"kind":"arxiv","id":"1903.11062","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11062","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11062v2","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11062","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"ECVQ5BA7KXWJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ECVQ5BA7KXWJGWMJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ECVQ5BA7","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ECVQ5BA7KXWJGWMJN373SSRBBO","target":"record","payload":{"canonical_record":{"source":{"id":"1903.11062","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-26T10:03:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e330e3ed4f61486e884c7a59ca2ff3d28c7d6b64e7a80f033a1bfd62aacc242f","abstract_canon_sha256":"b70e07725d5168d95c0d090d9baa70867a6ee6ebc47bef10a80f0c7faca71d03"},"schema_version":"1.0"},"canonical_sha256":"20ab0e841f55ec9359896effb94a210b8eb38b128b1b62ac3f21f02b17fcb4e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:49.044195Z","signature_b64":"/HXceenKTUGr60ctOIqrjk7ShsKKS707v/vedIZNbGyR/FFCEclK7WfByJuawU4n4AAj2v6g6TufFne3RYRvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20ab0e841f55ec9359896effb94a210b8eb38b128b1b62ac3f21f02b17fcb4e3","last_reissued_at":"2026-05-17T23:40:49.043515Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:49.043515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.11062","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-17T23:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFNPqxb2/8MeVehZKWYR8dCZmRduPnWZ7W9A+goTuDz6a+D7F97Ian6bPqkCkJe2HaG3yiwNIi9Oj8nJP22SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:49:31.907932Z"},"content_sha256":"125f00171f365878fdee17680b39dec8780062a7ac3df824b2439c327d783662","schema_version":"1.0","event_id":"sha256:125f00171f365878fdee17680b39dec8780062a7ac3df824b2439c327d783662"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ECVQ5BA7KXWJGWMJN373SSRBBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing isomorphism of circular-arc graphs in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Ilia Ponomarenko, Peter Zeman, Roman Nedela","submitted_at":"2019-03-26T10:03:19Z","abstract_excerpt":"A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be tested by the Weisfeiler-Leman algorithm after individualization of two vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11062","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-17T23:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vp4JiBHMyFRCEeNvXiwd/fPE/nfufvKEd6YUsCZ2DidqWU86chuUQyKS/CoOVvVebldOrhakXfALHOk+IcdlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:49:31.908402Z"},"content_sha256":"57e07d1339f07f8d66cb3fa81f198ad9aa3a83251d2e9bb4f4a234a761dde9e4","schema_version":"1.0","event_id":"sha256:57e07d1339f07f8d66cb3fa81f198ad9aa3a83251d2e9bb4f4a234a761dde9e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/bundle.json","state_url":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/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-29T22:49:31Z","links":{"resolver":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO","bundle":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/bundle.json","state":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ECVQ5BA7KXWJGWMJN373SSRBBO","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":"b70e07725d5168d95c0d090d9baa70867a6ee6ebc47bef10a80f0c7faca71d03","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-26T10:03:19Z","title_canon_sha256":"e330e3ed4f61486e884c7a59ca2ff3d28c7d6b64e7a80f033a1bfd62aacc242f"},"schema_version":"1.0","source":{"id":"1903.11062","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.11062","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"1903.11062v2","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11062","created_at":"2026-05-17T23:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"ECVQ5BA7KXWJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ECVQ5BA7KXWJGWMJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ECVQ5BA7","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:57e07d1339f07f8d66cb3fa81f198ad9aa3a83251d2e9bb4f4a234a761dde9e4","target":"graph","created_at":"2026-05-17T23:40:49Z","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 graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be tested by the Weisfeiler-Leman algorithm after individualization of two vertices.","authors_text":"Ilia Ponomarenko, Peter Zeman, Roman Nedela","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-26T10:03:19Z","title":"Testing isomorphism of circular-arc graphs in polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11062","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:125f00171f365878fdee17680b39dec8780062a7ac3df824b2439c327d783662","target":"record","created_at":"2026-05-17T23:40:49Z","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":"b70e07725d5168d95c0d090d9baa70867a6ee6ebc47bef10a80f0c7faca71d03","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-26T10:03:19Z","title_canon_sha256":"e330e3ed4f61486e884c7a59ca2ff3d28c7d6b64e7a80f033a1bfd62aacc242f"},"schema_version":"1.0","source":{"id":"1903.11062","kind":"arxiv","version":2}},"canonical_sha256":"20ab0e841f55ec9359896effb94a210b8eb38b128b1b62ac3f21f02b17fcb4e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20ab0e841f55ec9359896effb94a210b8eb38b128b1b62ac3f21f02b17fcb4e3","first_computed_at":"2026-05-17T23:40:49.043515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:49.043515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/HXceenKTUGr60ctOIqrjk7ShsKKS707v/vedIZNbGyR/FFCEclK7WfByJuawU4n4AAj2v6g6TufFne3RYRvCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:49.044195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.11062","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:125f00171f365878fdee17680b39dec8780062a7ac3df824b2439c327d783662","sha256:57e07d1339f07f8d66cb3fa81f198ad9aa3a83251d2e9bb4f4a234a761dde9e4"],"state_sha256":"36cc2af14d6a9c7a4f532f60ddd9ac50100d2f71485f1847498d70d4561aa688"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mq6JrMoNy+CxVMxIh6phvPkJNkv5ztTH9OsdUMHRFE4U/4v6xpUohqA6T8x3eIqaFxhd5gxn182k05VCSR16BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:49:31.911026Z","bundle_sha256":"74e66f0574ab03d3685bae52a98e90ca447a7a3770a55f91f0efdbaf3c272be8"}}