{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RUD7WSNNCHTWJPIF5NB2X5UTK6","short_pith_number":"pith:RUD7WSNN","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"},"canonical_sha256":"8d07fb49ad11e764bd05eb43abf69357b55fa9b914c4ae611c3707de283a96a0","source":{"kind":"arxiv","id":"1904.04501","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04501","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04501v3","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04501","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"RUD7WSNNCHTW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RUD7WSNNCHTWJPIF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RUD7WSNN","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RUD7WSNNCHTWJPIF5NB2X5UTK6","target":"record","payload":{"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"},"canonical_sha256":"8d07fb49ad11e764bd05eb43abf69357b55fa9b914c4ae611c3707de283a96a0","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"},"source_kind":"arxiv","source_id":"1904.04501","source_version":3,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Fl1fP7DsE/DMUZ/sm7A0XORvaG1bNpHUztxvt2aEM48lpbpQX4tmFgEd7dbLa4+ydZ2f8EqNzjqEHohw0FFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:54:11.439484Z"},"content_sha256":"fbdb98ab9531a86f8f4875662caa1e9971adba9bb7ca429276e9c439c0de033b","schema_version":"1.0","event_id":"sha256:fbdb98ab9531a86f8f4875662caa1e9971adba9bb7ca429276e9c439c0de033b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RUD7WSNNCHTWJPIF5NB2X5UTK6","target":"graph","payload":{"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"},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqPYJUOve6l/7nWshtw1nIXDR+LDtwqKhzdXHgLyXI7CzVMAn3b6Ms/xndZr/rZB7uGh7/39h9cR0pvkBTqTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:54:11.440205Z"},"content_sha256":"d49687e4dc4eb59d06d34e817e0a822ca76e4465b32038b12cf5b3026cbc889f","schema_version":"1.0","event_id":"sha256:d49687e4dc4eb59d06d34e817e0a822ca76e4465b32038b12cf5b3026cbc889f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/bundle.json","state_url":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/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-06-09T04:54:11Z","links":{"resolver":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6","bundle":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/bundle.json","state":"https://pith.science/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUD7WSNNCHTWJPIF5NB2X5UTK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RUD7WSNNCHTWJPIF5NB2X5UTK6","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":"867d2c4ef4a69719a2a07093603049caac7edf696722f161606eb85476fcb1af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T07:38:12Z","title_canon_sha256":"8a798fa6fd0497480fd008a0a918b00ddf9baff02bc8eb29eb76296abffb6a04"},"schema_version":"1.0","source":{"id":"1904.04501","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04501","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04501v3","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04501","created_at":"2026-05-17T23:40:43Z"},{"alias_kind":"pith_short_12","alias_value":"RUD7WSNNCHTW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RUD7WSNNCHTWJPIF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RUD7WSNN","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:d49687e4dc4eb59d06d34e817e0a822ca76e4465b32038b12cf5b3026cbc889f","target":"graph","created_at":"2026-05-17T23:40:43Z","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":"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 ","authors_text":"Tomasz Krawczyk","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T07:38:12Z","title":"Testing isomorphism of circular-arc graphs -- Hsu's approach revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04501","kind":"arxiv","version":3},"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:fbdb98ab9531a86f8f4875662caa1e9971adba9bb7ca429276e9c439c0de033b","target":"record","created_at":"2026-05-17T23:40:43Z","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":"867d2c4ef4a69719a2a07093603049caac7edf696722f161606eb85476fcb1af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T07:38:12Z","title_canon_sha256":"8a798fa6fd0497480fd008a0a918b00ddf9baff02bc8eb29eb76296abffb6a04"},"schema_version":"1.0","source":{"id":"1904.04501","kind":"arxiv","version":3}},"canonical_sha256":"8d07fb49ad11e764bd05eb43abf69357b55fa9b914c4ae611c3707de283a96a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d07fb49ad11e764bd05eb43abf69357b55fa9b914c4ae611c3707de283a96a0","first_computed_at":"2026-05-17T23:40:43.312704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:43.312704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Y1YfD6OW5L+o05Ch5bS+rXYSmeh2+3YpQiYarVHlQROiY1xrc2A7TdM5RsSZrKCaS0Ambi5s2rz3IXPpmsQDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:43.313286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04501","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbdb98ab9531a86f8f4875662caa1e9971adba9bb7ca429276e9c439c0de033b","sha256:d49687e4dc4eb59d06d34e817e0a822ca76e4465b32038b12cf5b3026cbc889f"],"state_sha256":"26d996d4f8adea9cca1242d96d1b9400ce768abef807cfb11bb4c3e61369bd48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzDnzBmxhyL8MlMmL5SqgFcFa5qRFFjItPbWMjopupFglE64zVIoXCjlKBY+eSKJUKxpnyVVP4avIgMgVU3tAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:54:11.444185Z","bundle_sha256":"a422096b978f97285d132500ee4970d65487f5b84183d1df9a32051f8cc587b4"}}