{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RUD7WSNNCHTWJPIF5NB2X5UTK6","short_pith_number":"pith:RUD7WSNN","schema_version":"1.0","canonical_sha256":"8d07fb49ad11e764bd05eb43abf69357b55fa9b914c4ae611c3707de283a96a0","source":{"kind":"arxiv","id":"1904.04501","version":3},"attestation_state":"computed","paper":{"title":"Testing isomorphism of circular-arc graphs -- Hsu's approach revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Tomasz Krawczyk","submitted_at":"2019-04-09T07:38:12Z","abstract_excerpt":"Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorphic. To accomplish our task we construct decomposition trees, which are the structures representing all normalized intersection models of circular-arc graphs. Normalized models reflect the neighbourhood relation in circular-arc graphs and can be seen as their canonical representations; in particular, every intersection model can be easily transformed into a normalized one.\n  Our work adapts and appropriately extends "},"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":"1904.04501","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T07:38:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8a798fa6fd0497480fd008a0a918b00ddf9baff02bc8eb29eb76296abffb6a04","abstract_canon_sha256":"867d2c4ef4a69719a2a07093603049caac7edf696722f161606eb85476fcb1af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:43.313286Z","signature_b64":"/Y1YfD6OW5L+o05Ch5bS+rXYSmeh2+3YpQiYarVHlQROiY1xrc2A7TdM5RsSZrKCaS0Ambi5s2rz3IXPpmsQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d07fb49ad11e764bd05eb43abf69357b55fa9b914c4ae611c3707de283a96a0","last_reissued_at":"2026-05-17T23:40:43.312704Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:43.312704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Testing isomorphism of circular-arc graphs -- Hsu's approach revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Tomasz Krawczyk","submitted_at":"2019-04-09T07:38:12Z","abstract_excerpt":"Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorphic. To accomplish our task we construct decomposition trees, which are the structures representing all normalized intersection models of circular-arc graphs. Normalized models reflect the neighbourhood relation in circular-arc graphs and can be seen as their canonical representations; in particular, every intersection model can be easily transformed into a normalized one.\n  Our work adapts and appropriately extends "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04501","kind":"arxiv","version":3},"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":"1904.04501","created_at":"2026-05-17T23:40:43.312792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04501v3","created_at":"2026-05-17T23:40:43.312792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04501","created_at":"2026-05-17T23:40:43.312792+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUD7WSNNCHTW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUD7WSNNCHTWJPIF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUD7WSNN","created_at":"2026-05-18T12:33:27.125529+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/RUD7WSNNCHTWJPIF5NB2X5UTK6","json":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6.json","graph_json":"https://pith.science/api/pith-number/RUD7WSNNCHTWJPIF5NB2X5UTK6/graph.json","events_json":"https://pith.science/api/pith-number/RUD7WSNNCHTWJPIF5NB2X5UTK6/events.json","paper":"https://pith.science/paper/RUD7WSNN"},"agent_actions":{"view_html":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6","download_json":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6.json","view_paper":"https://pith.science/paper/RUD7WSNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04501&json=true","fetch_graph":"https://pith.science/api/pith-number/RUD7WSNNCHTWJPIF5NB2X5UTK6/graph.json","fetch_events":"https://pith.science/api/pith-number/RUD7WSNNCHTWJPIF5NB2X5UTK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/action/storage_attestation","attest_author":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/action/author_attestation","sign_citation":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/action/citation_signature","submit_replication":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/action/replication_record"}},"created_at":"2026-05-17T23:40:43.312792+00:00","updated_at":"2026-05-17T23:40:43.312792+00:00"}