{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:R7CFQ7BP6BJCEJ5LSOYZ5HFTVL","short_pith_number":"pith:R7CFQ7BP","canonical_record":{"source":{"id":"2012.09814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-12-17T18:32:25Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"ec16aa33c30c6f7137abfff4594690652a0ae488e42866b224ba1f2220030fbc","abstract_canon_sha256":"60d5f0fa855246ec67271ab2a22e24aea6e47dd91c4cd668f2b55a489821c219"},"schema_version":"1.0"},"canonical_sha256":"8fc4587c2ff0522227ab93b19e9cb3aae52f0226570a52ab9bdf7dccc27a5293","source":{"kind":"arxiv","id":"2012.09814","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09814","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09814v2","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09814","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"R7CFQ7BP6BJC","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"pith_short_16","alias_value":"R7CFQ7BP6BJCEJ5L","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"pith_short_8","alias_value":"R7CFQ7BP","created_at":"2026-07-05T03:26:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:R7CFQ7BP6BJCEJ5LSOYZ5HFTVL","target":"record","payload":{"canonical_record":{"source":{"id":"2012.09814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-12-17T18:32:25Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"title_canon_sha256":"ec16aa33c30c6f7137abfff4594690652a0ae488e42866b224ba1f2220030fbc","abstract_canon_sha256":"60d5f0fa855246ec67271ab2a22e24aea6e47dd91c4cd668f2b55a489821c219"},"schema_version":"1.0"},"canonical_sha256":"8fc4587c2ff0522227ab93b19e9cb3aae52f0226570a52ab9bdf7dccc27a5293","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:14.542557Z","signature_b64":"SBclkJc19laHLJTRuMc898ty85VIvTQj43S0CYF2sfn2A6AAQngo0F6voRGxp4ov7sUt0Ke753iFqs3W6d3BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fc4587c2ff0522227ab93b19e9cb3aae52f0226570a52ab9bdf7dccc27a5293","last_reissued_at":"2026-07-05T03:26:14.542016Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:14.542016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.09814","source_version":2,"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-07-05T03:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWm0My3HvKgknSIn4+WFn+88Oicpz/tzAVhPU6PJjdRogkv/wqy9YmJgY42LvkUPFyGJXWZA0u8RLCLFlpVsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:47:33.973320Z"},"content_sha256":"c65511dfe7c4f8bff20929952dab13f4529bba5adf674e0c309b588b36648a73","schema_version":"1.0","event_id":"sha256:c65511dfe7c4f8bff20929952dab13f4529bba5adf674e0c309b588b36648a73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:R7CFQ7BP6BJCEJ5LSOYZ5HFTVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induced Disjoint Paths in AT-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","submitted_at":"2020-12-17T18:32:25Z","abstract_excerpt":"Paths $P_1,\\ldots,P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to decide if a graph $G$ with $k$ pairs of specified vertices $(s_i,t_i)$ contains $k$ mutually induced paths $P_i$ such that each $P_i$ connects $s_i$ and $t_i$. This is a classical graph problem that is NP-complete even for $k=2$. We study it for AT-free graphs.\n  Unlike its subclasses of permutation graphs and cocomparability graphs, the class of AT-free graphs has no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09814","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/2012.09814/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"},"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-07-05T03:26:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KZR/saMtS0cB1AFnGZkqvIrk9YUs49+MohNVdbfNeC+PYn5rlWe4X/bHssVbe30U5F3Pe4wNxnMbQst7DWAxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T07:47:33.973637Z"},"content_sha256":"439f44da33e0fed82372280d926de086cffd583e2f412db3c19971f5f3583e24","schema_version":"1.0","event_id":"sha256:439f44da33e0fed82372280d926de086cffd583e2f412db3c19971f5f3583e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL/bundle.json","state_url":"https://pith.science/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL/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-08-14T07:47:33Z","links":{"resolver":"https://pith.science/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL","bundle":"https://pith.science/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL/bundle.json","state":"https://pith.science/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7CFQ7BP6BJCEJ5LSOYZ5HFTVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:R7CFQ7BP6BJCEJ5LSOYZ5HFTVL","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":"60d5f0fa855246ec67271ab2a22e24aea6e47dd91c4cd668f2b55a489821c219","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-12-17T18:32:25Z","title_canon_sha256":"ec16aa33c30c6f7137abfff4594690652a0ae488e42866b224ba1f2220030fbc"},"schema_version":"1.0","source":{"id":"2012.09814","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.09814","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"arxiv_version","alias_value":"2012.09814v2","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.09814","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"pith_short_12","alias_value":"R7CFQ7BP6BJC","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"pith_short_16","alias_value":"R7CFQ7BP6BJCEJ5L","created_at":"2026-07-05T03:26:14Z"},{"alias_kind":"pith_short_8","alias_value":"R7CFQ7BP","created_at":"2026-07-05T03:26:14Z"}],"graph_snapshots":[{"event_id":"sha256:439f44da33e0fed82372280d926de086cffd583e2f412db3c19971f5f3583e24","target":"graph","created_at":"2026-07-05T03:26:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.09814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Paths $P_1,\\ldots,P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to decide if a graph $G$ with $k$ pairs of specified vertices $(s_i,t_i)$ contains $k$ mutually induced paths $P_i$ such that each $P_i$ connects $s_i$ and $t_i$. This is a classical graph problem that is NP-complete even for $k=2$. We study it for AT-free graphs.\n  Unlike its subclasses of permutation graphs and cocomparability graphs, the class of AT-free graphs has no","authors_text":"Dani\\\"el Paulusma, Erik Jan van Leeuwen, Petr A. Golovach","cross_cats":["cs.CC","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-12-17T18:32:25Z","title":"Induced Disjoint Paths in AT-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.09814","kind":"arxiv","version":2},"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:c65511dfe7c4f8bff20929952dab13f4529bba5adf674e0c309b588b36648a73","target":"record","created_at":"2026-07-05T03:26:14Z","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":"60d5f0fa855246ec67271ab2a22e24aea6e47dd91c4cd668f2b55a489821c219","cross_cats_sorted":["cs.CC","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-12-17T18:32:25Z","title_canon_sha256":"ec16aa33c30c6f7137abfff4594690652a0ae488e42866b224ba1f2220030fbc"},"schema_version":"1.0","source":{"id":"2012.09814","kind":"arxiv","version":2}},"canonical_sha256":"8fc4587c2ff0522227ab93b19e9cb3aae52f0226570a52ab9bdf7dccc27a5293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fc4587c2ff0522227ab93b19e9cb3aae52f0226570a52ab9bdf7dccc27a5293","first_computed_at":"2026-07-05T03:26:14.542016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:26:14.542016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SBclkJc19laHLJTRuMc898ty85VIvTQj43S0CYF2sfn2A6AAQngo0F6voRGxp4ov7sUt0Ke753iFqs3W6d3BBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:26:14.542557Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.09814","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c65511dfe7c4f8bff20929952dab13f4529bba5adf674e0c309b588b36648a73","sha256:439f44da33e0fed82372280d926de086cffd583e2f412db3c19971f5f3583e24"],"state_sha256":"9972cb8d4b74d139493a1be2128d863b30fbbeea85045647d4650ec0639308b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9TmA1l3UmqzoZ1vC5YNh2yuqDlVpIMbpWjA9YQ5CdAjOBsI5CW2p3e5j3fmpusiWuJsn+dN0Y+usRCh/bBcMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T07:47:33.976593Z","bundle_sha256":"ae40545c664c31bc5eb904398ab52d40612722d55c223742d04780c3a407619a"}}