{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:234HABOSOBLZUMBKW7MR7JPQCC","short_pith_number":"pith:234HABOS","schema_version":"1.0","canonical_sha256":"d6f87005d270579a302ab7d91fa5f010ac324f46b1e126f7805c961bfef6f843","source":{"kind":"arxiv","id":"2411.13708","version":2},"attestation_state":"computed","paper":{"title":"Comments on \"$\\mathcal{O}(m\\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs\"","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Tomasz Krawczyk","submitted_at":"2024-11-20T20:58:08Z","abstract_excerpt":"In the work [$\\mathcal{O}(m\\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24(3), 411--439, (1995)], Wen-Lian Hsu claims three results concerning the class of circular-arc graphs: - the design of so-called \\emph{decomposition trees} that represent the structure of all normalized intersection models of circular-arc graphs, - an $\\mathcal{O}(m\\cdot n)$ recognition algorithm for circular-arc graphs, - an $\\mathcal{O}(m\\cdot n)$ isomorphism algorithm for circular-arc graphs. In [Discrete Math. Theor. Comput. Sci., 15(1), 157--182, 2013] Cur"},"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":"2411.13708","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-20T20:58:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"65b300b0e934bf728eb0bad7fb6833cbc5e0055b068674047b084cce5bbeb56d","abstract_canon_sha256":"bf27fd5f20cc07621437fcec6c5f2989c1c3e22b77d7724b41f044b0d2d66104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:44.762229Z","signature_b64":"cWtMYJJDe4oglwA8SjFbsqeA6lNjxqWFz6HytroRmTEPsbPfIdzBQ50FJzcszkA5FGAFpnaWezaROwlho0haBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6f87005d270579a302ab7d91fa5f010ac324f46b1e126f7805c961bfef6f843","last_reissued_at":"2026-07-05T09:40:44.761797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:44.761797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comments on \"$\\mathcal{O}(m\\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs\"","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Tomasz Krawczyk","submitted_at":"2024-11-20T20:58:08Z","abstract_excerpt":"In the work [$\\mathcal{O}(m\\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24(3), 411--439, (1995)], Wen-Lian Hsu claims three results concerning the class of circular-arc graphs: - the design of so-called \\emph{decomposition trees} that represent the structure of all normalized intersection models of circular-arc graphs, - an $\\mathcal{O}(m\\cdot n)$ recognition algorithm for circular-arc graphs, - an $\\mathcal{O}(m\\cdot n)$ isomorphism algorithm for circular-arc graphs. In [Discrete Math. Theor. Comput. Sci., 15(1), 157--182, 2013] Cur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13708","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.13708/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.13708","created_at":"2026-07-05T09:40:44.761850+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13708v2","created_at":"2026-07-05T09:40:44.761850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13708","created_at":"2026-07-05T09:40:44.761850+00:00"},{"alias_kind":"pith_short_12","alias_value":"234HABOSOBLZ","created_at":"2026-07-05T09:40:44.761850+00:00"},{"alias_kind":"pith_short_16","alias_value":"234HABOSOBLZUMBK","created_at":"2026-07-05T09:40:44.761850+00:00"},{"alias_kind":"pith_short_8","alias_value":"234HABOS","created_at":"2026-07-05T09:40:44.761850+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13374","citing_title":"On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC","json":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC.json","graph_json":"https://pith.science/api/pith-number/234HABOSOBLZUMBKW7MR7JPQCC/graph.json","events_json":"https://pith.science/api/pith-number/234HABOSOBLZUMBKW7MR7JPQCC/events.json","paper":"https://pith.science/paper/234HABOS"},"agent_actions":{"view_html":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC","download_json":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC.json","view_paper":"https://pith.science/paper/234HABOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13708&json=true","fetch_graph":"https://pith.science/api/pith-number/234HABOSOBLZUMBKW7MR7JPQCC/graph.json","fetch_events":"https://pith.science/api/pith-number/234HABOSOBLZUMBKW7MR7JPQCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC/action/storage_attestation","attest_author":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC/action/author_attestation","sign_citation":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC/action/citation_signature","submit_replication":"https://pith.science/pith/234HABOSOBLZUMBKW7MR7JPQCC/action/replication_record"}},"created_at":"2026-07-05T09:40:44.761850+00:00","updated_at":"2026-07-05T09:40:44.761850+00:00"}