{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3G2EPOSWDGJJNI73NJKFLG2IR5","short_pith_number":"pith:3G2EPOSW","canonical_record":{"source":{"id":"1803.00882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-01T13:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"ccc073925c682edafc1b05f327126f4e49fba7978d2a32dcc2b54d5762b70024","abstract_canon_sha256":"f62363af8d879bbc83f9b45ac8b63ba3f35712e917cc9966cc49bf8a8a87409e"},"schema_version":"1.0"},"canonical_sha256":"d9b447ba56199296a3fb6a54559b488f4b8911360325f26799ede7300c19cd9f","source":{"kind":"arxiv","id":"1803.00882","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00882","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00882v2","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00882","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"3G2EPOSWDGJJ","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"pith_short_16","alias_value":"3G2EPOSWDGJJNI73","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"pith_short_8","alias_value":"3G2EPOSW","created_at":"2026-07-05T01:41:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3G2EPOSWDGJJNI73NJKFLG2IR5","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00882","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-01T13:12:40Z","cross_cats_sorted":[],"title_canon_sha256":"ccc073925c682edafc1b05f327126f4e49fba7978d2a32dcc2b54d5762b70024","abstract_canon_sha256":"f62363af8d879bbc83f9b45ac8b63ba3f35712e917cc9966cc49bf8a8a87409e"},"schema_version":"1.0"},"canonical_sha256":"d9b447ba56199296a3fb6a54559b488f4b8911360325f26799ede7300c19cd9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:27.459082Z","signature_b64":"QUV6pMxz+jveBe4lA6PQKQWWOrVYSqj+dUSxDxYZT2LBfhurZvZDrdvCyBBl79oDzj3scrH7G4B9JjhCbwZdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b447ba56199296a3fb6a54559b488f4b8911360325f26799ede7300c19cd9f","last_reissued_at":"2026-07-05T01:41:27.458588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:27.458588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00882","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-05T01:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAvSRA6YNgiME/Xh/Kal5/zRPAJmS6/ChCYbkQLAEItm7FbaT/EPCbgPdYmButI9sfjPDxLjKaY5QZioZbVuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:49:18.881379Z"},"content_sha256":"182b6cd096daf4c9ec01bf0875790bbcc63cb02db8486ee7c66ee6b42e413b8f","schema_version":"1.0","event_id":"sha256:182b6cd096daf4c9ec01bf0875790bbcc63cb02db8486ee7c66ee6b42e413b8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3G2EPOSWDGJJNI73NJKFLG2IR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Graph Classes: A View Through Temporal Separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hendrik Molter, Malte Renken, Philipp Zschoche, Rolf Niedermeier, Till Fluschnik","submitted_at":"2018-03-01T13:12:40Z","abstract_excerpt":"We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding Temporal (s, z)-Separation problem is NP-hard, it is natural to investigate whether relevant special cases exist that are computationally tractable. To this end, we study restrictions of the underlying (static) graph---there we observe polynomial-time solvability in the case of bounded treewidth---as well as restrictions concerning the \"temporal evolution\" a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00882","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/1803.00882/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-05T01:41:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hsRzkLLh9KRVx2s53CX+PuEzffuJsnnHPc2RgCDIhmjaZ5xjTYQpQJ4hQk0DvJqbkWdvEk0fnoO8XEcNMHhUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:49:18.881752Z"},"content_sha256":"e2625e324d54d8f9de5d71848a09eb48002b1a03bc3df0c082eaaf8f08a3b65b","schema_version":"1.0","event_id":"sha256:e2625e324d54d8f9de5d71848a09eb48002b1a03bc3df0c082eaaf8f08a3b65b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3G2EPOSWDGJJNI73NJKFLG2IR5/bundle.json","state_url":"https://pith.science/pith/3G2EPOSWDGJJNI73NJKFLG2IR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3G2EPOSWDGJJNI73NJKFLG2IR5/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-06T13:49:18Z","links":{"resolver":"https://pith.science/pith/3G2EPOSWDGJJNI73NJKFLG2IR5","bundle":"https://pith.science/pith/3G2EPOSWDGJJNI73NJKFLG2IR5/bundle.json","state":"https://pith.science/pith/3G2EPOSWDGJJNI73NJKFLG2IR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3G2EPOSWDGJJNI73NJKFLG2IR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3G2EPOSWDGJJNI73NJKFLG2IR5","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":"f62363af8d879bbc83f9b45ac8b63ba3f35712e917cc9966cc49bf8a8a87409e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-01T13:12:40Z","title_canon_sha256":"ccc073925c682edafc1b05f327126f4e49fba7978d2a32dcc2b54d5762b70024"},"schema_version":"1.0","source":{"id":"1803.00882","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00882","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00882v2","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00882","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"pith_short_12","alias_value":"3G2EPOSWDGJJ","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"pith_short_16","alias_value":"3G2EPOSWDGJJNI73","created_at":"2026-07-05T01:41:27Z"},{"alias_kind":"pith_short_8","alias_value":"3G2EPOSW","created_at":"2026-07-05T01:41:27Z"}],"graph_snapshots":[{"event_id":"sha256:e2625e324d54d8f9de5d71848a09eb48002b1a03bc3df0c082eaaf8f08a3b65b","target":"graph","created_at":"2026-07-05T01:41:27Z","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/1803.00882/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding Temporal (s, z)-Separation problem is NP-hard, it is natural to investigate whether relevant special cases exist that are computationally tractable. To this end, we study restrictions of the underlying (static) graph---there we observe polynomial-time solvability in the case of bounded treewidth---as well as restrictions concerning the \"temporal evolution\" a","authors_text":"Hendrik Molter, Malte Renken, Philipp Zschoche, Rolf Niedermeier, Till Fluschnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-01T13:12:40Z","title":"Temporal Graph Classes: A View Through Temporal Separators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00882","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:182b6cd096daf4c9ec01bf0875790bbcc63cb02db8486ee7c66ee6b42e413b8f","target":"record","created_at":"2026-07-05T01:41:27Z","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":"f62363af8d879bbc83f9b45ac8b63ba3f35712e917cc9966cc49bf8a8a87409e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-01T13:12:40Z","title_canon_sha256":"ccc073925c682edafc1b05f327126f4e49fba7978d2a32dcc2b54d5762b70024"},"schema_version":"1.0","source":{"id":"1803.00882","kind":"arxiv","version":2}},"canonical_sha256":"d9b447ba56199296a3fb6a54559b488f4b8911360325f26799ede7300c19cd9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9b447ba56199296a3fb6a54559b488f4b8911360325f26799ede7300c19cd9f","first_computed_at":"2026-07-05T01:41:27.458588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:41:27.458588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUV6pMxz+jveBe4lA6PQKQWWOrVYSqj+dUSxDxYZT2LBfhurZvZDrdvCyBBl79oDzj3scrH7G4B9JjhCbwZdDA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:41:27.459082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00882","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:182b6cd096daf4c9ec01bf0875790bbcc63cb02db8486ee7c66ee6b42e413b8f","sha256:e2625e324d54d8f9de5d71848a09eb48002b1a03bc3df0c082eaaf8f08a3b65b"],"state_sha256":"cc18776e0919a86ecde4ce01b1008b02c87274fbee9f863d23f3d40e20f5aff6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCOOAXkNzRCFW3crkuslkSobgrG4xxQGoR1YGmSHolPj2XREFTdL8vjW56RTyrGWXqDpKoT7V59Ljv5OXphzBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:49:18.883683Z","bundle_sha256":"dd2712662d73273365eaad5036a98629456e1844fab29ec1dce153b13f46c3d5"}}