{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QEVLUJZINFSIQN6XFB5ZY2G3JN","short_pith_number":"pith:QEVLUJZI","canonical_record":{"source":{"id":"1711.00963","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T22:30:07Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"146385853ac8287da53151d4076964652aaad8177ae7eafd2f7f07aa1ce094fb","abstract_canon_sha256":"7b28d98998827d2a8673307e8c31a44483e8899818a755eabb0d5a1f022bd6e0"},"schema_version":"1.0"},"canonical_sha256":"812aba272869648837d7287b9c68db4b73dac835aca39fc4572799e5f01e20f2","source":{"kind":"arxiv","id":"1711.00963","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00963","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00963v5","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00963","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"QEVLUJZINFSI","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QEVLUJZINFSIQN6X","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QEVLUJZI","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QEVLUJZINFSIQN6XFB5ZY2G3JN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.00963","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T22:30:07Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"146385853ac8287da53151d4076964652aaad8177ae7eafd2f7f07aa1ce094fb","abstract_canon_sha256":"7b28d98998827d2a8673307e8c31a44483e8899818a755eabb0d5a1f022bd6e0"},"schema_version":"1.0"},"canonical_sha256":"812aba272869648837d7287b9c68db4b73dac835aca39fc4572799e5f01e20f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:52.883140Z","signature_b64":"+Wr2PPyjLnb5qzSNpN9U5cLDcTFv/qe2vBmbEYHq0DJaObkxNPjO0i8lUb0ESqSrar8azVseRI+0/Wtn4MORAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"812aba272869648837d7287b9c68db4b73dac835aca39fc4572799e5f01e20f2","last_reissued_at":"2026-05-18T00:09:52.882452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:52.882452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.00963","source_version":5,"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:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POTMf8slHxSr2LEWg/vySR7IsYZHZCiGZka3OvfxkdGktnDJMH7jwqrS8z184t/HIRkCszTIo+FND7KyUN7eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:59:52.142140Z"},"content_sha256":"d02a2cd85b26ade0bf996df0f31251a70c5291f809275af903f2aad3ab8fcc58","schema_version":"1.0","event_id":"sha256:d02a2cd85b26ade0bf996df0f31251a70c5291f809275af903f2aad3ab8fcc58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QEVLUJZINFSIQN6XFB5ZY2G3JN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Finding Small Separators in Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Hendrik Molter, Philipp Zschoche, Rolf Niedermeier, Till Fluschnik","submitted_at":"2017-11-02T22:30:07Z","abstract_excerpt":"Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex set (the separator) with respect to two designated terminal vertices such that the removal of the set eliminates all temporal paths connecting one terminal to the other. Herein, we consider two models of temporal paths: paths that pass through arbitrarily many edges per time step (non-strict) and paths that pass through at most one edge per time step (strict). Regarding the number of time steps of a temporal graph, we show a complexity dichotomy (NP-hardness versus polynomial-time solvability) fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00963","kind":"arxiv","version":5},"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:09:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zL9QeTl3RPmnUl8QFUzwGS3IzEieWZiRgH8vbC7BaNhvSK8ZK1lzpexsAVFnp91AykFPbYKXZU36yKRinRXYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:59:52.142816Z"},"content_sha256":"a94982a00cfcf5df245b3371ab63929cbb017372488b5c086c0cbd2fee181f02","schema_version":"1.0","event_id":"sha256:a94982a00cfcf5df245b3371ab63929cbb017372488b5c086c0cbd2fee181f02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN/bundle.json","state_url":"https://pith.science/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN/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-06T06:59:52Z","links":{"resolver":"https://pith.science/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN","bundle":"https://pith.science/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN/bundle.json","state":"https://pith.science/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEVLUJZINFSIQN6XFB5ZY2G3JN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QEVLUJZINFSIQN6XFB5ZY2G3JN","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":"7b28d98998827d2a8673307e8c31a44483e8899818a755eabb0d5a1f022bd6e0","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T22:30:07Z","title_canon_sha256":"146385853ac8287da53151d4076964652aaad8177ae7eafd2f7f07aa1ce094fb"},"schema_version":"1.0","source":{"id":"1711.00963","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00963","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00963v5","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00963","created_at":"2026-05-18T00:09:52Z"},{"alias_kind":"pith_short_12","alias_value":"QEVLUJZINFSI","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"QEVLUJZINFSIQN6X","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"QEVLUJZI","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:a94982a00cfcf5df245b3371ab63929cbb017372488b5c086c0cbd2fee181f02","target":"graph","created_at":"2026-05-18T00:09:52Z","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":"Temporal graphs are graphs with time-stamped edges. We study the problem of finding a small vertex set (the separator) with respect to two designated terminal vertices such that the removal of the set eliminates all temporal paths connecting one terminal to the other. Herein, we consider two models of temporal paths: paths that pass through arbitrarily many edges per time step (non-strict) and paths that pass through at most one edge per time step (strict). Regarding the number of time steps of a temporal graph, we show a complexity dichotomy (NP-hardness versus polynomial-time solvability) fo","authors_text":"Hendrik Molter, Philipp Zschoche, Rolf Niedermeier, Till Fluschnik","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T22:30:07Z","title":"The Complexity of Finding Small Separators in Temporal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00963","kind":"arxiv","version":5},"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:d02a2cd85b26ade0bf996df0f31251a70c5291f809275af903f2aad3ab8fcc58","target":"record","created_at":"2026-05-18T00:09:52Z","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":"7b28d98998827d2a8673307e8c31a44483e8899818a755eabb0d5a1f022bd6e0","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T22:30:07Z","title_canon_sha256":"146385853ac8287da53151d4076964652aaad8177ae7eafd2f7f07aa1ce094fb"},"schema_version":"1.0","source":{"id":"1711.00963","kind":"arxiv","version":5}},"canonical_sha256":"812aba272869648837d7287b9c68db4b73dac835aca39fc4572799e5f01e20f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"812aba272869648837d7287b9c68db4b73dac835aca39fc4572799e5f01e20f2","first_computed_at":"2026-05-18T00:09:52.882452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:52.882452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+Wr2PPyjLnb5qzSNpN9U5cLDcTFv/qe2vBmbEYHq0DJaObkxNPjO0i8lUb0ESqSrar8azVseRI+0/Wtn4MORAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:52.883140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00963","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d02a2cd85b26ade0bf996df0f31251a70c5291f809275af903f2aad3ab8fcc58","sha256:a94982a00cfcf5df245b3371ab63929cbb017372488b5c086c0cbd2fee181f02"],"state_sha256":"b27607e9ac6808ef6955358feabd0dbc56726d0450b633c7d7cf4b40184f4940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0N6/RM8OewWvEldPiNL0q+kqTTlu64cKdafBQ6fMWXXkqaVDG2E6KUkbgvAwBcPEU0/dJ3KmpfcDqfYXI1sFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:59:52.147123Z","bundle_sha256":"e3be56aa74c1e92a3d0b4344911acc786c76ae30cdce650381c16b95fa0ba40b"}}