{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZIB36AOPTLB5L2356SEIENNP4S","short_pith_number":"pith:ZIB36AOP","canonical_record":{"source":{"id":"1702.06858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T15:39:12Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f97b63e07e07974ce7594ea88d318196425df220c0ec8a47e932afd3145cfb28","abstract_canon_sha256":"a304321e6c9b09573192e03955766706d6afb1520ec4ef03502903897ff01661"},"schema_version":"1.0"},"canonical_sha256":"ca03bf01cf9ac3d5eb7df4888235afe488e58146853c837204b28ac29e4c218a","source":{"kind":"arxiv","id":"1702.06858","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06858","created_at":"2026-05-18T00:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06858v2","created_at":"2026-05-18T00:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06858","created_at":"2026-05-18T00:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZIB36AOPTLB5","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZIB36AOPTLB5L235","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZIB36AOP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZIB36AOPTLB5L2356SEIENNP4S","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06858","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T15:39:12Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f97b63e07e07974ce7594ea88d318196425df220c0ec8a47e932afd3145cfb28","abstract_canon_sha256":"a304321e6c9b09573192e03955766706d6afb1520ec4ef03502903897ff01661"},"schema_version":"1.0"},"canonical_sha256":"ca03bf01cf9ac3d5eb7df4888235afe488e58146853c837204b28ac29e4c218a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:45.740276Z","signature_b64":"jLl8LptetzxAec7fGWmnjWslWnsRO36Gc7pJQbkfka+/KvhHF4eYPzoHw46Lpe5jJ1BDIDePClQq5zYyPn+OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca03bf01cf9ac3d5eb7df4888235afe488e58146853c837204b28ac29e4c218a","last_reissued_at":"2026-05-18T00:47:45.739579Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:45.739579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06858","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-05-18T00:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIqh/Ne3EoOhSVLhMUmYbHjd84yvc4Hx/RCyqGNaHWh1HCIQOLmNCh6byVRr4pllLUXroq+JTl56FILBICVyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:10:18.591073Z"},"content_sha256":"2d44deb79cefad23b760b0a88c32524479132697503738b87017103389b78a4a","schema_version":"1.0","event_id":"sha256:2d44deb79cefad23b760b0a88c32524479132697503738b87017103389b78a4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZIB36AOPTLB5L2356SEIENNP4S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Emptiness of zero automata is decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.FL","authors_text":"Edon Kelmendi (LaBRI), Hugo Gimbert (LaBRI), Mikolaj Boja\\'nczyk","submitted_at":"2017-02-22T15:39:12Z","abstract_excerpt":"Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant of zero automata called nonzero automata. We prove that for every zero automaton there is an equivalent nonzero automaton of quadratic size and the emptiness problem of nonzero automata is decidable and both in NP and in coNP. These results imply that tmso + zero has decidable satisfiability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06858","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":""},"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:47:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9dbXsKWbJxRj81f3BN1CCUTNJ+YpccLrLCX6gZZmEYSvnArcPeYEOh2OXJeGSouG1OQDIgQqkg2ny0nuYzSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:10:18.591462Z"},"content_sha256":"40e1c3891732f8d4c040aae9a7a994f86b78b2fb0816e79514d1751101e31cdd","schema_version":"1.0","event_id":"sha256:40e1c3891732f8d4c040aae9a7a994f86b78b2fb0816e79514d1751101e31cdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIB36AOPTLB5L2356SEIENNP4S/bundle.json","state_url":"https://pith.science/pith/ZIB36AOPTLB5L2356SEIENNP4S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIB36AOPTLB5L2356SEIENNP4S/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-31T06:10:18Z","links":{"resolver":"https://pith.science/pith/ZIB36AOPTLB5L2356SEIENNP4S","bundle":"https://pith.science/pith/ZIB36AOPTLB5L2356SEIENNP4S/bundle.json","state":"https://pith.science/pith/ZIB36AOPTLB5L2356SEIENNP4S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIB36AOPTLB5L2356SEIENNP4S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZIB36AOPTLB5L2356SEIENNP4S","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":"a304321e6c9b09573192e03955766706d6afb1520ec4ef03502903897ff01661","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T15:39:12Z","title_canon_sha256":"f97b63e07e07974ce7594ea88d318196425df220c0ec8a47e932afd3145cfb28"},"schema_version":"1.0","source":{"id":"1702.06858","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06858","created_at":"2026-05-18T00:47:45Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06858v2","created_at":"2026-05-18T00:47:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06858","created_at":"2026-05-18T00:47:45Z"},{"alias_kind":"pith_short_12","alias_value":"ZIB36AOPTLB5","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZIB36AOPTLB5L235","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZIB36AOP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:40e1c3891732f8d4c040aae9a7a994f86b78b2fb0816e79514d1751101e31cdd","target":"graph","created_at":"2026-05-18T00:47:45Z","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":"Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the emptiness problem for zero automata. We introduce a variant of zero automata called nonzero automata. We prove that for every zero automaton there is an equivalent nonzero automaton of quadratic size and the emptiness problem of nonzero automata is decidable and both in NP and in coNP. These results imply that tmso + zero has decidable satisfiability.","authors_text":"Edon Kelmendi (LaBRI), Hugo Gimbert (LaBRI), Mikolaj Boja\\'nczyk","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T15:39:12Z","title":"Emptiness of zero automata is decidable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06858","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:2d44deb79cefad23b760b0a88c32524479132697503738b87017103389b78a4a","target":"record","created_at":"2026-05-18T00:47:45Z","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":"a304321e6c9b09573192e03955766706d6afb1520ec4ef03502903897ff01661","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-02-22T15:39:12Z","title_canon_sha256":"f97b63e07e07974ce7594ea88d318196425df220c0ec8a47e932afd3145cfb28"},"schema_version":"1.0","source":{"id":"1702.06858","kind":"arxiv","version":2}},"canonical_sha256":"ca03bf01cf9ac3d5eb7df4888235afe488e58146853c837204b28ac29e4c218a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca03bf01cf9ac3d5eb7df4888235afe488e58146853c837204b28ac29e4c218a","first_computed_at":"2026-05-18T00:47:45.739579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:45.739579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLl8LptetzxAec7fGWmnjWslWnsRO36Gc7pJQbkfka+/KvhHF4eYPzoHw46Lpe5jJ1BDIDePClQq5zYyPn+OCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:45.740276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06858","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d44deb79cefad23b760b0a88c32524479132697503738b87017103389b78a4a","sha256:40e1c3891732f8d4c040aae9a7a994f86b78b2fb0816e79514d1751101e31cdd"],"state_sha256":"d5d4c65d7de3dcc0b0e110235b875284bd87f497107a2ca00e13deaaa644e039"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34L/OOjgvR8dOt2aMRACeT0VHW68HHiB20yCHgDal2wABbYOF6azy0mE894RMU+LsZKdy8gA80u9mILUd3HsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:10:18.593621Z","bundle_sha256":"2cd5377d1a81cad16a4bd779172aa494e3938533838c56fffbe3ca8d4197a074"}}