{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HE57ORZQP6YPEAF2NUNNI247ZX","short_pith_number":"pith:HE57ORZQ","canonical_record":{"source":{"id":"1602.02670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T17:51:52Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b98ff09bcbdb086ba204142d2f1f9b3d2576e093a816c850d1df1814ff629504","abstract_canon_sha256":"a8256b3837f906874ca6df1b664e649cbc6443ae08c33ac737ce154b02bf1735"},"schema_version":"1.0"},"canonical_sha256":"393bf747307fb0f200ba6d1ad46b9fcdf9a320b1f1fc17663e551ffb6a4683d0","source":{"kind":"arxiv","id":"1602.02670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02670","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02670v1","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02670","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"HE57ORZQP6YP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HE57ORZQP6YPEAF2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HE57ORZQ","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HE57ORZQP6YPEAF2NUNNI247ZX","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T17:51:52Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b98ff09bcbdb086ba204142d2f1f9b3d2576e093a816c850d1df1814ff629504","abstract_canon_sha256":"a8256b3837f906874ca6df1b664e649cbc6443ae08c33ac737ce154b02bf1735"},"schema_version":"1.0"},"canonical_sha256":"393bf747307fb0f200ba6d1ad46b9fcdf9a320b1f1fc17663e551ffb6a4683d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:09.202195Z","signature_b64":"PjrfAYMzB0e3pjvqmKV50xgItl29VW/DVthHA+lmBRilGfpCec0L5J+0RPQCe6jOigMRQX1xfEJfCDiKoxEXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"393bf747307fb0f200ba6d1ad46b9fcdf9a320b1f1fc17663e551ffb6a4683d0","last_reissued_at":"2026-05-18T01:21:09.201545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:09.201545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02670","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-18T01:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGi21WP80E6KGsxOKAyEnKguqjOHoCsiUc64qKVPZOGKKWtjG61uoHx8ievDVDyuTSJP619mh75YJk3GeuSrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:13.389642Z"},"content_sha256":"3e5432efc9187e42d070eae233f914009247a21f04d201b057c8726c8cb3cc65","schema_version":"1.0","event_id":"sha256:3e5432efc9187e42d070eae233f914009247a21f04d201b057c8726c8cb3cc65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HE57ORZQP6YPEAF2NUNNI247ZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Wolfgang Dvo\\v{r}\\'ak","submitted_at":"2016-02-08T17:51:52Z","abstract_excerpt":"Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental $\\omega$-regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02670","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-18T01:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19hl9wKtnkikf4ozJjoR1I9exE10LcOTjpVz7ufKpz5ncPKOIldSkQZljgedelvtUPlUg/fsQ0ryd1qXibdpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:13.389992Z"},"content_sha256":"037001a34219df4e998094e08be7375b92b8fd564857439a854f296785fc3ece","schema_version":"1.0","event_id":"sha256:037001a34219df4e998094e08be7375b92b8fd564857439a854f296785fc3ece"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/bundle.json","state_url":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HE57ORZQP6YPEAF2NUNNI247ZX/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-05-25T11:42:13Z","links":{"resolver":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX","bundle":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/bundle.json","state":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HE57ORZQP6YPEAF2NUNNI247ZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HE57ORZQP6YPEAF2NUNNI247ZX","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":"a8256b3837f906874ca6df1b664e649cbc6443ae08c33ac737ce154b02bf1735","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T17:51:52Z","title_canon_sha256":"b98ff09bcbdb086ba204142d2f1f9b3d2576e093a816c850d1df1814ff629504"},"schema_version":"1.0","source":{"id":"1602.02670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02670","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02670v1","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02670","created_at":"2026-05-18T01:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"HE57ORZQP6YP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HE57ORZQP6YPEAF2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HE57ORZQ","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:037001a34219df4e998094e08be7375b92b8fd564857439a854f296785fc3ece","target":"graph","created_at":"2026-05-18T01:21:09Z","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":"Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental $\\omega$-regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lo","authors_text":"Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Wolfgang Dvo\\v{r}\\'ak","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T17:51:52Z","title":"Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02670","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:3e5432efc9187e42d070eae233f914009247a21f04d201b057c8726c8cb3cc65","target":"record","created_at":"2026-05-18T01:21:09Z","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":"a8256b3837f906874ca6df1b664e649cbc6443ae08c33ac737ce154b02bf1735","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-08T17:51:52Z","title_canon_sha256":"b98ff09bcbdb086ba204142d2f1f9b3d2576e093a816c850d1df1814ff629504"},"schema_version":"1.0","source":{"id":"1602.02670","kind":"arxiv","version":1}},"canonical_sha256":"393bf747307fb0f200ba6d1ad46b9fcdf9a320b1f1fc17663e551ffb6a4683d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"393bf747307fb0f200ba6d1ad46b9fcdf9a320b1f1fc17663e551ffb6a4683d0","first_computed_at":"2026-05-18T01:21:09.201545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:09.201545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PjrfAYMzB0e3pjvqmKV50xgItl29VW/DVthHA+lmBRilGfpCec0L5J+0RPQCe6jOigMRQX1xfEJfCDiKoxEXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:09.202195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e5432efc9187e42d070eae233f914009247a21f04d201b057c8726c8cb3cc65","sha256:037001a34219df4e998094e08be7375b92b8fd564857439a854f296785fc3ece"],"state_sha256":"6cf736bc580f281d82e44d52b548222db60f1f1460a7096d7d4480f564af6986"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tV4yD+0lKzzwG7Dtt80oKrz1aq479GZ2vjzDz28nRFLW1vjknOhp/MO931KisSWjxXT2+UkZh6F44cwGmaLaDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:42:13.392140Z","bundle_sha256":"209caf636d08997053a8e3a78246c6ec01bb9d083769d791077c907791d8f0a9"}}