{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","short_pith_number":"pith:5DCDAS7Q","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"},"canonical_sha256":"e8c4304bf0ec61dd5ca507250de6a67dc29866f24183ef90849195cf5272b5fe","source":{"kind":"arxiv","id":"1403.0789","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0789","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0789v1","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0789","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"5DCDAS7Q5RQ5","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5DCDAS7Q5RQ52XFF","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5DCDAS7Q","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","target":"record","payload":{"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"},"canonical_sha256":"e8c4304bf0ec61dd5ca507250de6a67dc29866f24183ef90849195cf5272b5fe","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"},"source_kind":"arxiv","source_id":"1403.0789","source_version":1,"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-18T02:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3Ig2iNlYJRmVpVFTtq8DKC3smS3Rkbcw//nrPvI/F5jbpoGX57jSgo8kT6lPEgO9mWNCr87X5VPJgMU0Pv6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:09.039138Z"},"content_sha256":"6b7130821c86e4a3ff5050322ce3fd96c351ac8d0934a67bd2c0a7726f3643a1","schema_version":"1.0","event_id":"sha256:6b7130821c86e4a3ff5050322ce3fd96c351ac8d0934a67bd2c0a7726f3643a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","target":"graph","payload":{"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"},"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-18T02:57:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjlFVZtbCe9vDPvG0eTbtQrc/4SSItowAhbJAssYMAHwuIsePUSxUmTSdH/xOTgCTGgShhNvqGnj79rbZ3wTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:09.039842Z"},"content_sha256":"000c988cb85b64c66284b631752aea23541c2c1dd7a598bbf9a7aa39fc8b69eb","schema_version":"1.0","event_id":"sha256:000c988cb85b64c66284b631752aea23541c2c1dd7a598bbf9a7aa39fc8b69eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/bundle.json","state_url":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/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-05-25T18:57:09Z","links":{"resolver":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","bundle":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/bundle.json","state":"https://pith.science/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DCDAS7Q5RQ52XFFA4SQ3ZVGPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5DCDAS7Q5RQ52XFFA4SQ3ZVGPX","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":"a4f58e8293cfb588c873f1b910cf242f2af72eeeba29e6845be94cd4c3045014","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-04T14:00:11Z","title_canon_sha256":"fec00a2a9a47744b43810ef6c529be61e742cd8f038e6c14691fc4f3c190f383"},"schema_version":"1.0","source":{"id":"1403.0789","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0789","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0789v1","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0789","created_at":"2026-05-18T02:57:15Z"},{"alias_kind":"pith_short_12","alias_value":"5DCDAS7Q5RQ5","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5DCDAS7Q5RQ52XFF","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5DCDAS7Q","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:000c988cb85b64c66284b631752aea23541c2c1dd7a598bbf9a7aa39fc8b69eb","target":"graph","created_at":"2026-05-18T02:57:15Z","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":"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.","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-04T14:00:11Z","title":"Induced Disjoint Paths in Circular-Arc Graphs in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0789","kind":"arxiv","version":1},"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:6b7130821c86e4a3ff5050322ce3fd96c351ac8d0934a67bd2c0a7726f3643a1","target":"record","created_at":"2026-05-18T02:57:15Z","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":"a4f58e8293cfb588c873f1b910cf242f2af72eeeba29e6845be94cd4c3045014","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-04T14:00:11Z","title_canon_sha256":"fec00a2a9a47744b43810ef6c529be61e742cd8f038e6c14691fc4f3c190f383"},"schema_version":"1.0","source":{"id":"1403.0789","kind":"arxiv","version":1}},"canonical_sha256":"e8c4304bf0ec61dd5ca507250de6a67dc29866f24183ef90849195cf5272b5fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8c4304bf0ec61dd5ca507250de6a67dc29866f24183ef90849195cf5272b5fe","first_computed_at":"2026-05-18T02:57:15.715048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:15.715048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jtO/8T+DL/uqfD0gKVasWG2kdMTBcM/RosUxPFi3CUpl3rT7b8JAtcXMkDMYnB5rj0ysrWZWR78LbgmkvUySBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:15.715704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0789","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b7130821c86e4a3ff5050322ce3fd96c351ac8d0934a67bd2c0a7726f3643a1","sha256:000c988cb85b64c66284b631752aea23541c2c1dd7a598bbf9a7aa39fc8b69eb"],"state_sha256":"2a06079e48ea0e22232165d02a9c4cab056192d28dfa62a048b089ed32acd38a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCqpDdCPccJuESCEpzD6Upir+oe/Y/2CL7NOJY56+KQ+bTHvg23SXQZSmmuV6QNR5VNmZwuIZiHD3UaBOYzjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:57:09.044181Z","bundle_sha256":"11262e9d7d2dfe0d0d98082c6c7d7bc25039de42df846a0806cc7072f8a0ad20"}}