{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HE57ORZQP6YPEAF2NUNNI247ZX","short_pith_number":"pith:HE57ORZQ","schema_version":"1.0","canonical_sha256":"393bf747307fb0f200ba6d1ad46b9fcdf9a320b1f1fc17663e551ffb6a4683d0","source":{"kind":"arxiv","id":"1602.02670","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02670","created_at":"2026-05-18T01:21:09.201645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02670v1","created_at":"2026-05-18T01:21:09.201645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02670","created_at":"2026-05-18T01:21:09.201645+00:00"},{"alias_kind":"pith_short_12","alias_value":"HE57ORZQP6YP","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HE57ORZQP6YPEAF2","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HE57ORZQ","created_at":"2026-05-18T12:30:19.053100+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/HE57ORZQP6YPEAF2NUNNI247ZX","json":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX.json","graph_json":"https://pith.science/api/pith-number/HE57ORZQP6YPEAF2NUNNI247ZX/graph.json","events_json":"https://pith.science/api/pith-number/HE57ORZQP6YPEAF2NUNNI247ZX/events.json","paper":"https://pith.science/paper/HE57ORZQ"},"agent_actions":{"view_html":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX","download_json":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX.json","view_paper":"https://pith.science/paper/HE57ORZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02670&json=true","fetch_graph":"https://pith.science/api/pith-number/HE57ORZQP6YPEAF2NUNNI247ZX/graph.json","fetch_events":"https://pith.science/api/pith-number/HE57ORZQP6YPEAF2NUNNI247ZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/action/storage_attestation","attest_author":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/action/author_attestation","sign_citation":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/action/citation_signature","submit_replication":"https://pith.science/pith/HE57ORZQP6YPEAF2NUNNI247ZX/action/replication_record"}},"created_at":"2026-05-18T01:21:09.201645+00:00","updated_at":"2026-05-18T01:21:09.201645+00:00"}