{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6IWZWK7YDM6QYTAU347R3UXUJM","short_pith_number":"pith:6IWZWK7Y","canonical_record":{"source":{"id":"1607.05850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-20T07:57:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b4622959b72392691924289a3d2b8cce61995b27faf3ba35c0184dd4b1e2fe9d","abstract_canon_sha256":"8392b48edb1aafa733cea9f6fbe3b8f444001be99efaa2c430e48c33aee807ae"},"schema_version":"1.0"},"canonical_sha256":"f22d9b2bf81b3d0c4c14df3f1dd2f44b2d15a8f02e3816bd8d0fcc38ba6cda2b","source":{"kind":"arxiv","id":"1607.05850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05850","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05850v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05850","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"6IWZWK7YDM6Q","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6IWZWK7YDM6QYTAU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6IWZWK7Y","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6IWZWK7YDM6QYTAU347R3UXUJM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-20T07:57:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b4622959b72392691924289a3d2b8cce61995b27faf3ba35c0184dd4b1e2fe9d","abstract_canon_sha256":"8392b48edb1aafa733cea9f6fbe3b8f444001be99efaa2c430e48c33aee807ae"},"schema_version":"1.0"},"canonical_sha256":"f22d9b2bf81b3d0c4c14df3f1dd2f44b2d15a8f02e3816bd8d0fcc38ba6cda2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:33.137405Z","signature_b64":"ELaDSYH6xAyi/I4EeBHavUjULVgH7H9ks/eJMIpMIIK8upWcgFSznkyQfygvl/0hN10r6gW0A0/jm2zwifGPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f22d9b2bf81b3d0c4c14df3f1dd2f44b2d15a8f02e3816bd8d0fcc38ba6cda2b","last_reissued_at":"2026-05-18T00:58:33.136653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:33.136653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05850","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-18T00:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQ7cdLOVakIo7axqVn/YILZMZEomzxYWQZ5EmAbRRQKwta0GaMlKLPDf1VIIqOhqaYr/ZAzTMaFE94sWTrxTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:52:39.438352Z"},"content_sha256":"2659111bed2d816fcdf4eb3fa1cab216f1ecce571248ff6eacb7988551326144","schema_version":"1.0","event_id":"sha256:2659111bed2d816fcdf4eb3fa1cab216f1ecce571248ff6eacb7988551326144"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6IWZWK7YDM6QYTAU347R3UXUJM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conditionally Optimal Algorithms for Generalized B\\\"uchi Games","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-07-20T07:57:57Z","abstract_excerpt":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as the verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or B\\\"uchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized B\\\"uchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized B\\\"uchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05850","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-18T00:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghFq/o14uKD7yppGROaTPb2VhlT0BkU9q8RQxsNHeQShgPuHNE+Tc85IQqe8JLStJIK6u5i8szcQNRA4D5OYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:52:39.439109Z"},"content_sha256":"2c11b471598bed799e4814d0d5e71668cd0e5bb5815a9ed17f18b5f1c82d3b73","schema_version":"1.0","event_id":"sha256:2c11b471598bed799e4814d0d5e71668cd0e5bb5815a9ed17f18b5f1c82d3b73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IWZWK7YDM6QYTAU347R3UXUJM/bundle.json","state_url":"https://pith.science/pith/6IWZWK7YDM6QYTAU347R3UXUJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IWZWK7YDM6QYTAU347R3UXUJM/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-25T22:52:39Z","links":{"resolver":"https://pith.science/pith/6IWZWK7YDM6QYTAU347R3UXUJM","bundle":"https://pith.science/pith/6IWZWK7YDM6QYTAU347R3UXUJM/bundle.json","state":"https://pith.science/pith/6IWZWK7YDM6QYTAU347R3UXUJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IWZWK7YDM6QYTAU347R3UXUJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6IWZWK7YDM6QYTAU347R3UXUJM","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":"8392b48edb1aafa733cea9f6fbe3b8f444001be99efaa2c430e48c33aee807ae","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-20T07:57:57Z","title_canon_sha256":"b4622959b72392691924289a3d2b8cce61995b27faf3ba35c0184dd4b1e2fe9d"},"schema_version":"1.0","source":{"id":"1607.05850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05850","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05850v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05850","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"6IWZWK7YDM6Q","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6IWZWK7YDM6QYTAU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6IWZWK7Y","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2c11b471598bed799e4814d0d5e71668cd0e5bb5815a9ed17f18b5f1c82d3b73","target":"graph","created_at":"2026-05-18T00:58:33Z","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":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as the verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or B\\\"uchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized B\\\"uchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized B\\\"uchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verific","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-07-20T07:57:57Z","title":"Conditionally Optimal Algorithms for Generalized B\\\"uchi Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05850","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:2659111bed2d816fcdf4eb3fa1cab216f1ecce571248ff6eacb7988551326144","target":"record","created_at":"2026-05-18T00:58:33Z","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":"8392b48edb1aafa733cea9f6fbe3b8f444001be99efaa2c430e48c33aee807ae","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-20T07:57:57Z","title_canon_sha256":"b4622959b72392691924289a3d2b8cce61995b27faf3ba35c0184dd4b1e2fe9d"},"schema_version":"1.0","source":{"id":"1607.05850","kind":"arxiv","version":1}},"canonical_sha256":"f22d9b2bf81b3d0c4c14df3f1dd2f44b2d15a8f02e3816bd8d0fcc38ba6cda2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f22d9b2bf81b3d0c4c14df3f1dd2f44b2d15a8f02e3816bd8d0fcc38ba6cda2b","first_computed_at":"2026-05-18T00:58:33.136653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:33.136653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELaDSYH6xAyi/I4EeBHavUjULVgH7H9ks/eJMIpMIIK8upWcgFSznkyQfygvl/0hN10r6gW0A0/jm2zwifGPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:33.137405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2659111bed2d816fcdf4eb3fa1cab216f1ecce571248ff6eacb7988551326144","sha256:2c11b471598bed799e4814d0d5e71668cd0e5bb5815a9ed17f18b5f1c82d3b73"],"state_sha256":"abf672f06b0eedd332e4c8d41efd55825f397c4a2bb205b8cf1c526a9c9528c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJzmZobr0Nsp9Y5JcAvXC/K3pMgnUlphjApYlFHEbXEnS8nRCY6/XBLbklOwTBdgXm+sBsVO/b8qxAHIFKEmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:52:39.442954Z","bundle_sha256":"67cf7b27ceb2f1230d18590ef2848b74ad4a57e1734094ea7b8730988353b20d"}}