{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:35OCXAOWGXLC462MGO37ZNS45F","short_pith_number":"pith:35OCXAOW","schema_version":"1.0","canonical_sha256":"df5c2b81d635d62e7b4c33b7fcb65ce97eea7745cba21c56975cc9558371ef2a","source":{"kind":"arxiv","id":"2105.12003","version":1},"attestation_state":"computed","paper":{"title":"On Finding Separators in Temporal Split and Permutation Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Hendrik Molter, Malte Renken, Nicolas Maack, Rolf Niedermeier","submitted_at":"2021-05-25T15:12:32Z","abstract_excerpt":"Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separation problem is well-known to be polynomial solvable and serves as an important primitive in many applications related to network connectivity. We study the NP-hard temporal (s,z)-separation problem on temporal graphs, which are graphs with fixed vertex sets but edge sets that change over discrete time steps. We tackle this problem by restricting the layers (i.e., graphs characterized by edges that are present at a cert"},"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":"2105.12003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-05-25T15:12:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3d99850f9a64eda8426fc421113e137cfbf4be5e72a0b2f86df7a55c14cb3ca5","abstract_canon_sha256":"547bdfb128fbbb4b3f40c5f6cc5bef951b68ef7f38cb824ebe9de3430fd0f814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:59.197246Z","signature_b64":"TYH1Y0wHQzGZXQOlO7FD1NHELl8+ljfTL1I6dm1AJKIk6EN401uwPHpjKcjk4POx4UTmvvzugL4+l1jRJkAZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5c2b81d635d62e7b4c33b7fcb65ce97eea7745cba21c56975cc9558371ef2a","last_reissued_at":"2026-07-05T02:42:59.196843Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:59.196843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Finding Separators in Temporal Split and Permutation Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Hendrik Molter, Malte Renken, Nicolas Maack, Rolf Niedermeier","submitted_at":"2021-05-25T15:12:32Z","abstract_excerpt":"Removing all connections between two vertices s and z in a graph by removing a minimum number of vertices is a fundamental problem in algorithmic graph theory. This (s,z)-separation problem is well-known to be polynomial solvable and serves as an important primitive in many applications related to network connectivity. We study the NP-hard temporal (s,z)-separation problem on temporal graphs, which are graphs with fixed vertex sets but edge sets that change over discrete time steps. We tackle this problem by restricting the layers (i.e., graphs characterized by edges that are present at a cert"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12003","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.12003/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.12003","created_at":"2026-07-05T02:42:59.196908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12003v1","created_at":"2026-07-05T02:42:59.196908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12003","created_at":"2026-07-05T02:42:59.196908+00:00"},{"alias_kind":"pith_short_12","alias_value":"35OCXAOWGXLC","created_at":"2026-07-05T02:42:59.196908+00:00"},{"alias_kind":"pith_short_16","alias_value":"35OCXAOWGXLC462M","created_at":"2026-07-05T02:42:59.196908+00:00"},{"alias_kind":"pith_short_8","alias_value":"35OCXAOW","created_at":"2026-07-05T02:42:59.196908+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/35OCXAOWGXLC462MGO37ZNS45F","json":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F.json","graph_json":"https://pith.science/api/pith-number/35OCXAOWGXLC462MGO37ZNS45F/graph.json","events_json":"https://pith.science/api/pith-number/35OCXAOWGXLC462MGO37ZNS45F/events.json","paper":"https://pith.science/paper/35OCXAOW"},"agent_actions":{"view_html":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F","download_json":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F.json","view_paper":"https://pith.science/paper/35OCXAOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12003&json=true","fetch_graph":"https://pith.science/api/pith-number/35OCXAOWGXLC462MGO37ZNS45F/graph.json","fetch_events":"https://pith.science/api/pith-number/35OCXAOWGXLC462MGO37ZNS45F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/action/storage_attestation","attest_author":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/action/author_attestation","sign_citation":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/action/citation_signature","submit_replication":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/action/replication_record"}},"created_at":"2026-07-05T02:42:59.196908+00:00","updated_at":"2026-07-05T02:42:59.196908+00:00"}