{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:GFNREQS4FUOSFIDP77FDZDQIV4","short_pith_number":"pith:GFNREQS4","canonical_record":{"source":{"id":"0802.1226","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-02-08T23:13:52Z","cross_cats_sorted":[],"title_canon_sha256":"6673b7f5ddf8529a5c8f5c5736a2a572acabaa6dbd843b20d14c1398546a8338","abstract_canon_sha256":"1312d3a81f93c4f4030cc333efb9e7c3b4cc4132cec7db4573ae945656bb7d70"},"schema_version":"1.0"},"canonical_sha256":"315b12425c2d1d22a06fffca3c8e08af117e07b1f219ad203d23c929892fbc1f","source":{"kind":"arxiv","id":"0802.1226","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1226","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1226v3","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1226","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"GFNREQS4FUOS","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GFNREQS4FUOSFIDP","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GFNREQS4","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:GFNREQS4FUOSFIDP77FDZDQIV4","target":"record","payload":{"canonical_record":{"source":{"id":"0802.1226","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-02-08T23:13:52Z","cross_cats_sorted":[],"title_canon_sha256":"6673b7f5ddf8529a5c8f5c5736a2a572acabaa6dbd843b20d14c1398546a8338","abstract_canon_sha256":"1312d3a81f93c4f4030cc333efb9e7c3b4cc4132cec7db4573ae945656bb7d70"},"schema_version":"1.0"},"canonical_sha256":"315b12425c2d1d22a06fffca3c8e08af117e07b1f219ad203d23c929892fbc1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.527833Z","signature_b64":"s6KnBdJ4bRIs6RJTXudiFOYkzas6bp9yVecTU9SjXmi+wMi/ZLZHf7k5bznXofWLfRWh+LSv0/SX22pnrge3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"315b12425c2d1d22a06fffca3c8e08af117e07b1f219ad203d23c929892fbc1f","last_reissued_at":"2026-05-18T01:37:42.527087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.527087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.1226","source_version":3,"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:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9binqKTz66fES7O/ON5ptUUtyAjIBPx8unqg+qslI1RAGNOtJWvfcdsaUXMZxxv8WrEv6dzgxdpwYEklesp4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:42:43.540073Z"},"content_sha256":"957fd06eeb7840a8f395e8148eda1b366c8dcf81444db579a88b12703fdc53d9","schema_version":"1.0","event_id":"sha256:957fd06eeb7840a8f395e8148eda1b366c8dcf81444db579a88b12703fdc53d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:GFNREQS4FUOSFIDP77FDZDQIV4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Qiqi Yan","submitted_at":"2008-02-08T23:13:52Z","abstract_excerpt":"In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the large alphabet via alphabet substitutions. Then we apply such technique to the complementation of nondeterministic \\omega-automata, and obtain several lower bound results. Particularly, we prove an \\omega((0.76n)^n) lower bound for B\\\"uchi complementation, which also holds for almost every complementation or determinization transformation of nondeterministic o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1226","kind":"arxiv","version":3},"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:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3thLLbC82LG3h9NfSti9qSUHib9bbEsGBxRyULwyBZYyaX8u+HfEsA0mI3AaVmpRSqvzEWioJ4pX07qc7EICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:42:43.540642Z"},"content_sha256":"644fd5df864e4ace1940fc61640221a2568b25cf1c5557c57fb00bd5fc6ea7a3","schema_version":"1.0","event_id":"sha256:644fd5df864e4ace1940fc61640221a2568b25cf1c5557c57fb00bd5fc6ea7a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFNREQS4FUOSFIDP77FDZDQIV4/bundle.json","state_url":"https://pith.science/pith/GFNREQS4FUOSFIDP77FDZDQIV4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFNREQS4FUOSFIDP77FDZDQIV4/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-06-03T19:42:43Z","links":{"resolver":"https://pith.science/pith/GFNREQS4FUOSFIDP77FDZDQIV4","bundle":"https://pith.science/pith/GFNREQS4FUOSFIDP77FDZDQIV4/bundle.json","state":"https://pith.science/pith/GFNREQS4FUOSFIDP77FDZDQIV4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFNREQS4FUOSFIDP77FDZDQIV4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:GFNREQS4FUOSFIDP77FDZDQIV4","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":"1312d3a81f93c4f4030cc333efb9e7c3b4cc4132cec7db4573ae945656bb7d70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-02-08T23:13:52Z","title_canon_sha256":"6673b7f5ddf8529a5c8f5c5736a2a572acabaa6dbd843b20d14c1398546a8338"},"schema_version":"1.0","source":{"id":"0802.1226","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1226","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1226v3","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1226","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"GFNREQS4FUOS","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"GFNREQS4FUOSFIDP","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"GFNREQS4","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:644fd5df864e4ace1940fc61640221a2568b25cf1c5557c57fb00bd5fc6ea7a3","target":"graph","created_at":"2026-05-18T01:37:42Z","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":"In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the large alphabet via alphabet substitutions. Then we apply such technique to the complementation of nondeterministic \\omega-automata, and obtain several lower bound results. Particularly, we prove an \\omega((0.76n)^n) lower bound for B\\\"uchi complementation, which also holds for almost every complementation or determinization transformation of nondeterministic o","authors_text":"Qiqi Yan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-02-08T23:13:52Z","title":"Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1226","kind":"arxiv","version":3},"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:957fd06eeb7840a8f395e8148eda1b366c8dcf81444db579a88b12703fdc53d9","target":"record","created_at":"2026-05-18T01:37:42Z","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":"1312d3a81f93c4f4030cc333efb9e7c3b4cc4132cec7db4573ae945656bb7d70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-02-08T23:13:52Z","title_canon_sha256":"6673b7f5ddf8529a5c8f5c5736a2a572acabaa6dbd843b20d14c1398546a8338"},"schema_version":"1.0","source":{"id":"0802.1226","kind":"arxiv","version":3}},"canonical_sha256":"315b12425c2d1d22a06fffca3c8e08af117e07b1f219ad203d23c929892fbc1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"315b12425c2d1d22a06fffca3c8e08af117e07b1f219ad203d23c929892fbc1f","first_computed_at":"2026-05-18T01:37:42.527087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:42.527087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6KnBdJ4bRIs6RJTXudiFOYkzas6bp9yVecTU9SjXmi+wMi/ZLZHf7k5bznXofWLfRWh+LSv0/SX22pnrge3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:42.527833Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.1226","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:957fd06eeb7840a8f395e8148eda1b366c8dcf81444db579a88b12703fdc53d9","sha256:644fd5df864e4ace1940fc61640221a2568b25cf1c5557c57fb00bd5fc6ea7a3"],"state_sha256":"54d945eeb8ac2eff7b8027fc9db1bc97fd1fd5bda1c275ebeb83a39a4f79ae93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jmu/19zBzLIRfe4emuAMyxB/s6a2EISqBw1bmo2i46tCzRl7PVOoN2ToMmvBZ3lPDNEm96fl2s0ee8mCptYTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:42:43.543280Z","bundle_sha256":"481487931188fbd938f62e2b10fd577864e5ba3fe3c0e093c32d20b3d102766a"}}