{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","short_pith_number":"pith:5DCDAS7Q","schema_version":"1.0","canonical_sha256":"e8c4304bf0ec61dd5ca507250de6a67dc29866f24183ef90849195cf5272b5fe","source":{"kind":"arxiv","id":"1403.0789","version":1},"attestation_state":"computed","paper":{"title":"Induced Disjoint Paths in Circular-Arc Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","submitted_at":"2014-03-04T14:00:11Z","abstract_excerpt":"The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (s_i,t_i) contains paths P_1,...,P_k such that P_i connects s_i and t_i for i=1,...,k, and P_i and P_j have neither common vertices nor adjacent vertices (except perhaps their ends) for 1<=i < j<=k. We present a linear-time algorithm for Induced Disjoint Paths on circular-arc graphs. For interval graphs, we exhibit a linear-time algorithm for the generalization of Induced Disjoint Paths where the pairs (s_i,t_i) are not necessarily distinct."},"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":"1403.0789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-04T14:00:11Z","cross_cats_sorted":[],"title_canon_sha256":"fec00a2a9a47744b43810ef6c529be61e742cd8f038e6c14691fc4f3c190f383","abstract_canon_sha256":"a4f58e8293cfb588c873f1b910cf242f2af72eeeba29e6845be94cd4c3045014"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:15.715704Z","signature_b64":"jtO/8T+DL/uqfD0gKVasWG2kdMTBcM/RosUxPFi3CUpl3rT7b8JAtcXMkDMYnB5rj0ysrWZWR78LbgmkvUySBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c4304bf0ec61dd5ca507250de6a67dc29866f24183ef90849195cf5272b5fe","last_reissued_at":"2026-05-18T02:57:15.715048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:15.715048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced Disjoint Paths in Circular-Arc Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","submitted_at":"2014-03-04T14:00:11Z","abstract_excerpt":"The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (s_i,t_i) contains paths P_1,...,P_k such that P_i connects s_i and t_i for i=1,...,k, and P_i and P_j have neither common vertices nor adjacent vertices (except perhaps their ends) for 1<=i < j<=k. We present a linear-time algorithm for Induced Disjoint Paths on circular-arc graphs. For interval graphs, we exhibit a linear-time algorithm for the generalization of Induced Disjoint Paths where the pairs (s_i,t_i) are not necessarily distinct."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0789","kind":"arxiv","version":1},"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":"1403.0789","created_at":"2026-05-18T02:57:15.715144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0789v1","created_at":"2026-05-18T02:57:15.715144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0789","created_at":"2026-05-18T02:57:15.715144+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DCDAS7Q5RQ5","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DCDAS7Q5RQ52XFF","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DCDAS7Q","created_at":"2026-05-18T12:28:14.216126+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/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","json":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX.json","graph_json":"https://pith.science/api/pith-number/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/graph.json","events_json":"https://pith.science/api/pith-number/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/events.json","paper":"https://pith.science/paper/5DCDAS7Q"},"agent_actions":{"view_html":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","download_json":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX.json","view_paper":"https://pith.science/paper/5DCDAS7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0789&json=true","fetch_graph":"https://pith.science/api/pith-number/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/graph.json","fetch_events":"https://pith.science/api/pith-number/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/action/storage_attestation","attest_author":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/action/author_attestation","sign_citation":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/action/citation_signature","submit_replication":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/action/replication_record"}},"created_at":"2026-05-18T02:57:15.715144+00:00","updated_at":"2026-05-18T02:57:15.715144+00:00"}