{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ECVQ5BA7KXWJGWMJN373SSRBBO","short_pith_number":"pith:ECVQ5BA7","schema_version":"1.0","canonical_sha256":"20ab0e841f55ec9359896effb94a210b8eb38b128b1b62ac3f21f02b17fcb4e3","source":{"kind":"arxiv","id":"1903.11062","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.11062","created_at":"2026-05-17T23:40:49.043626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11062v2","created_at":"2026-05-17T23:40:49.043626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11062","created_at":"2026-05-17T23:40:49.043626+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECVQ5BA7KXWJ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECVQ5BA7KXWJGWMJ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECVQ5BA7","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO","json":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO.json","graph_json":"https://pith.science/api/pith-number/ECVQ5BA7KXWJGWMJN373SSRBBO/graph.json","events_json":"https://pith.science/api/pith-number/ECVQ5BA7KXWJGWMJN373SSRBBO/events.json","paper":"https://pith.science/paper/ECVQ5BA7"},"agent_actions":{"view_html":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO","download_json":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO.json","view_paper":"https://pith.science/paper/ECVQ5BA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11062&json=true","fetch_graph":"https://pith.science/api/pith-number/ECVQ5BA7KXWJGWMJN373SSRBBO/graph.json","fetch_events":"https://pith.science/api/pith-number/ECVQ5BA7KXWJGWMJN373SSRBBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/action/storage_attestation","attest_author":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/action/author_attestation","sign_citation":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/action/citation_signature","submit_replication":"https://pith.science/pith/ECVQ5BA7KXWJGWMJN373SSRBBO/action/replication_record"}},"created_at":"2026-05-17T23:40:49.043626+00:00","updated_at":"2026-05-17T23:40:49.043626+00:00"}