{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:35OCXAOWGXLC462MGO37ZNS45F","short_pith_number":"pith:35OCXAOW","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"},"canonical_sha256":"df5c2b81d635d62e7b4c33b7fcb65ce97eea7745cba21c56975cc9558371ef2a","source":{"kind":"arxiv","id":"2105.12003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12003","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12003v1","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12003","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"35OCXAOWGXLC","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_16","alias_value":"35OCXAOWGXLC462M","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_8","alias_value":"35OCXAOW","created_at":"2026-07-05T02:42:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:35OCXAOWGXLC462MGO37ZNS45F","target":"record","payload":{"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"},"canonical_sha256":"df5c2b81d635d62e7b4c33b7fcb65ce97eea7745cba21c56975cc9558371ef2a","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"},"source_kind":"arxiv","source_id":"2105.12003","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-07-05T02:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOVImD7duN/QKFROhhHusQnsKkS1LSzKBJ7HGV0nL70fphDJHPdwy/B4+QeZMEqgdzFSSf0HDKxLX9TaJwVxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:08:53.061300Z"},"content_sha256":"13c56dd762b8933c0b0b0d3226a5690634d5f27614cb20b7a0d1cb1120550d5f","schema_version":"1.0","event_id":"sha256:13c56dd762b8933c0b0b0d3226a5690634d5f27614cb20b7a0d1cb1120550d5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:35OCXAOWGXLC462MGO37ZNS45F","target":"graph","payload":{"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"},"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-05T02:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Z7pC7XKp2DS0hcvlncYUZMnzpd6r7KaiJL4FWID4aGS01g7b6AJuq7TPpU33nxvlvzWWrsLBkz14DSKVzg2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:08:53.061694Z"},"content_sha256":"6668ceb7be8425439f391281b84d80029aa7cbb31c261532cb98c7be052714d2","schema_version":"1.0","event_id":"sha256:6668ceb7be8425439f391281b84d80029aa7cbb31c261532cb98c7be052714d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/bundle.json","state_url":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35OCXAOWGXLC462MGO37ZNS45F/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-07-07T00:08:53Z","links":{"resolver":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F","bundle":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/bundle.json","state":"https://pith.science/pith/35OCXAOWGXLC462MGO37ZNS45F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35OCXAOWGXLC462MGO37ZNS45F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:35OCXAOWGXLC462MGO37ZNS45F","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":"547bdfb128fbbb4b3f40c5f6cc5bef951b68ef7f38cb824ebe9de3430fd0f814","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-05-25T15:12:32Z","title_canon_sha256":"3d99850f9a64eda8426fc421113e137cfbf4be5e72a0b2f86df7a55c14cb3ca5"},"schema_version":"1.0","source":{"id":"2105.12003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12003","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12003v1","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12003","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"35OCXAOWGXLC","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_16","alias_value":"35OCXAOWGXLC462M","created_at":"2026-07-05T02:42:59Z"},{"alias_kind":"pith_short_8","alias_value":"35OCXAOW","created_at":"2026-07-05T02:42:59Z"}],"graph_snapshots":[{"event_id":"sha256:6668ceb7be8425439f391281b84d80029aa7cbb31c261532cb98c7be052714d2","target":"graph","created_at":"2026-07-05T02:42:59Z","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/2105.12003/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hendrik Molter, Malte Renken, Nicolas Maack, Rolf Niedermeier","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-05-25T15:12:32Z","title":"On Finding Separators in Temporal Split and Permutation Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12003","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:13c56dd762b8933c0b0b0d3226a5690634d5f27614cb20b7a0d1cb1120550d5f","target":"record","created_at":"2026-07-05T02:42:59Z","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":"547bdfb128fbbb4b3f40c5f6cc5bef951b68ef7f38cb824ebe9de3430fd0f814","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-05-25T15:12:32Z","title_canon_sha256":"3d99850f9a64eda8426fc421113e137cfbf4be5e72a0b2f86df7a55c14cb3ca5"},"schema_version":"1.0","source":{"id":"2105.12003","kind":"arxiv","version":1}},"canonical_sha256":"df5c2b81d635d62e7b4c33b7fcb65ce97eea7745cba21c56975cc9558371ef2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df5c2b81d635d62e7b4c33b7fcb65ce97eea7745cba21c56975cc9558371ef2a","first_computed_at":"2026-07-05T02:42:59.196843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:59.196843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TYH1Y0wHQzGZXQOlO7FD1NHELl8+ljfTL1I6dm1AJKIk6EN401uwPHpjKcjk4POx4UTmvvzugL4+l1jRJkAZDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:59.197246Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13c56dd762b8933c0b0b0d3226a5690634d5f27614cb20b7a0d1cb1120550d5f","sha256:6668ceb7be8425439f391281b84d80029aa7cbb31c261532cb98c7be052714d2"],"state_sha256":"5d4f73d5af8351dd8c5551e167219323a9c4b3b1636063a5f876d1261cbfb7e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Laab1Lt3x+f9zhEOnsyqMU2tDOXkKBFNEWsiVRPJn6YAI/5KN9f9FPm5ettJqNH1FUbpTKzaBi/xlXwQm2mlAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T00:08:53.063610Z","bundle_sha256":"51825b069ef1b0afe9a522803fb6287e7cfdbe87fa540d2f6cbfe6897792b826"}}