{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DBCZMBTLMSWOVFXHS3I5SBIYIB","short_pith_number":"pith:DBCZMBTL","canonical_record":{"source":{"id":"1706.09066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T22:17:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"53d8e5587ba47fff49116795271ef09e87b3b1359f3cc8b519cf9fd1af6437b4","abstract_canon_sha256":"d2fd897008c7bc226cf44d5144351259a8574ac2a58aca801a0f18964acd1acf"},"schema_version":"1.0"},"canonical_sha256":"184596066b64acea96e796d1d9051840408170f6c6bf894ca8bc5c7867149748","source":{"kind":"arxiv","id":"1706.09066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09066","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09066v1","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09066","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"DBCZMBTLMSWO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBCZMBTLMSWOVFXH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBCZMBTL","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DBCZMBTLMSWOVFXHS3I5SBIYIB","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T22:17:20Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"53d8e5587ba47fff49116795271ef09e87b3b1359f3cc8b519cf9fd1af6437b4","abstract_canon_sha256":"d2fd897008c7bc226cf44d5144351259a8574ac2a58aca801a0f18964acd1acf"},"schema_version":"1.0"},"canonical_sha256":"184596066b64acea96e796d1d9051840408170f6c6bf894ca8bc5c7867149748","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:19.995109Z","signature_b64":"a2xZrl/eR7Qra+i1bajCWxqaFBQKT6qg0kSB10Vro99/JGPzeNtovaOphl6N6kufgAnnblUS1WIU4iSd6ueiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"184596066b64acea96e796d1d9051840408170f6c6bf894ca8bc5c7867149748","last_reissued_at":"2026-05-18T00:41:19.994287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:19.994287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09066","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-18T00:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W/4qAnuZeL425C4pBlLlUUwpausMB5vBxsIEu+p7sP0pelfeIwBM6Er2dZPzTaPTz4/9+yWjDKjksZ32YUEeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:26:05.278335Z"},"content_sha256":"d0f8870993866ae1f5eee05bc465abbe588be71489a42b1838da1a3430937a1e","schema_version":"1.0","event_id":"sha256:d0f8870993866ae1f5eee05bc465abbe588be71489a42b1838da1a3430937a1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DBCZMBTLMSWOVFXHS3I5SBIYIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of finding internally vertex-disjoint long directed paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ana Karolinna Maia, Ana Silva, Ignasi Sau, J\\'ulio Ara\\'ujo, Victor A. Campos","submitted_at":"2017-06-27T22:17:20Z","abstract_excerpt":"For two positive integers $k$ and $\\ell$, a $(k \\times \\ell)$-spindle is the union of $k$ pairwise internally vertex-disjoint directed paths with $\\ell$ arcs between two vertices $u$ and $v$. We are interested in the (parameterized) complexity of several problems consisting in deciding whether a given digraph contains a subdivision of a spindle, which generalize both the Maximum Flow and Longest Path problems. We obtain the following complexity dichotomy: for a fixed $\\ell \\geq 1$, finding the largest $k$ such that an input digraph $G$ contains a subdivision of a $(k \\times \\ell)$-spindle is p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09066","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-18T00:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ehyJ+giIkLIvsUvx8NZrg77y48rQ8FHRYFATGj2zYn4uh5slNbJ3TkxdyJFvDBvGXNUiueH50tord/CIrP+lAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:26:05.278692Z"},"content_sha256":"b9f42a5ab3bcf558d1a1c5e428232a107b05245cd3363d0216267d4864ef19df","schema_version":"1.0","event_id":"sha256:b9f42a5ab3bcf558d1a1c5e428232a107b05245cd3363d0216267d4864ef19df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB/bundle.json","state_url":"https://pith.science/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB/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-03T04:26:05Z","links":{"resolver":"https://pith.science/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB","bundle":"https://pith.science/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB/bundle.json","state":"https://pith.science/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBCZMBTLMSWOVFXHS3I5SBIYIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DBCZMBTLMSWOVFXHS3I5SBIYIB","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":"d2fd897008c7bc226cf44d5144351259a8574ac2a58aca801a0f18964acd1acf","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T22:17:20Z","title_canon_sha256":"53d8e5587ba47fff49116795271ef09e87b3b1359f3cc8b519cf9fd1af6437b4"},"schema_version":"1.0","source":{"id":"1706.09066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09066","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09066v1","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09066","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"DBCZMBTLMSWO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBCZMBTLMSWOVFXH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBCZMBTL","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:b9f42a5ab3bcf558d1a1c5e428232a107b05245cd3363d0216267d4864ef19df","target":"graph","created_at":"2026-05-18T00:41:19Z","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":"For two positive integers $k$ and $\\ell$, a $(k \\times \\ell)$-spindle is the union of $k$ pairwise internally vertex-disjoint directed paths with $\\ell$ arcs between two vertices $u$ and $v$. We are interested in the (parameterized) complexity of several problems consisting in deciding whether a given digraph contains a subdivision of a spindle, which generalize both the Maximum Flow and Longest Path problems. We obtain the following complexity dichotomy: for a fixed $\\ell \\geq 1$, finding the largest $k$ such that an input digraph $G$ contains a subdivision of a $(k \\times \\ell)$-spindle is p","authors_text":"Ana Karolinna Maia, Ana Silva, Ignasi Sau, J\\'ulio Ara\\'ujo, Victor A. Campos","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T22:17:20Z","title":"On the complexity of finding internally vertex-disjoint long directed paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09066","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:d0f8870993866ae1f5eee05bc465abbe588be71489a42b1838da1a3430937a1e","target":"record","created_at":"2026-05-18T00:41:19Z","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":"d2fd897008c7bc226cf44d5144351259a8574ac2a58aca801a0f18964acd1acf","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-27T22:17:20Z","title_canon_sha256":"53d8e5587ba47fff49116795271ef09e87b3b1359f3cc8b519cf9fd1af6437b4"},"schema_version":"1.0","source":{"id":"1706.09066","kind":"arxiv","version":1}},"canonical_sha256":"184596066b64acea96e796d1d9051840408170f6c6bf894ca8bc5c7867149748","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"184596066b64acea96e796d1d9051840408170f6c6bf894ca8bc5c7867149748","first_computed_at":"2026-05-18T00:41:19.994287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:19.994287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2xZrl/eR7Qra+i1bajCWxqaFBQKT6qg0kSB10Vro99/JGPzeNtovaOphl6N6kufgAnnblUS1WIU4iSd6ueiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:19.995109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0f8870993866ae1f5eee05bc465abbe588be71489a42b1838da1a3430937a1e","sha256:b9f42a5ab3bcf558d1a1c5e428232a107b05245cd3363d0216267d4864ef19df"],"state_sha256":"21651cf8119ec9eddb0d129611e96b7f90e2e8b50f6ad9cd78d4d9391fdaed84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/I3ff3zpApq7K+xi7MHV7NUI6xY0ul5yuPXwh+seKSkOHwWUkQ5RM11Roobmv7WWZK0/YcX+jY5J7J+tQbOCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:26:05.280643Z","bundle_sha256":"9de95769bf80bd7bdd3306288de49c20fc8c4605386bfcd3cf28dfa82df954fb"}}