{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DL4REL2PMFFNZ6346FABFC36TJ","short_pith_number":"pith:DL4REL2P","canonical_record":{"source":{"id":"1905.07139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T07:26:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9bee3fec4242ebdd11e2ea4771f5072510a3255252dcc6a69b96ecbeb7bb0886","abstract_canon_sha256":"92572658f4f8cb3dcf02df54ef118baaf3ea5cd268d13cbab606407288002cef"},"schema_version":"1.0"},"canonical_sha256":"1af9122f4f614adcfb7cf140128b7e9a6348cb4d4044155505d46c91337cc0a4","source":{"kind":"arxiv","id":"1905.07139","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07139","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07139v2","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07139","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"DL4REL2PMFFN","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"pith_short_16","alias_value":"DL4REL2PMFFNZ634","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"pith_short_8","alias_value":"DL4REL2P","created_at":"2026-07-05T00:09:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DL4REL2PMFFNZ6346FABFC36TJ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T07:26:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9bee3fec4242ebdd11e2ea4771f5072510a3255252dcc6a69b96ecbeb7bb0886","abstract_canon_sha256":"92572658f4f8cb3dcf02df54ef118baaf3ea5cd268d13cbab606407288002cef"},"schema_version":"1.0"},"canonical_sha256":"1af9122f4f614adcfb7cf140128b7e9a6348cb4d4044155505d46c91337cc0a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:50.742107Z","signature_b64":"n/PcNUxsXZr3uJh2E5oOfBh6OY/kj2ykv4xdsoU+6MRcqjykmCGAcCOv+QYaRyK/mppSH9vB0Z8Bqe9/Sb2/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1af9122f4f614adcfb7cf140128b7e9a6348cb4d4044155505d46c91337cc0a4","last_reissued_at":"2026-07-05T00:09:50.741692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:50.741692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07139","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-07-05T00:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHIIhFRaST64JlUDjOq7/xNHiAyiEdyI2XlnYFQgwpfrYJ9Hu/BYAeCxMqi5g7aa6JBLJP+h0qHQweUNEQNUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:34:55.890408Z"},"content_sha256":"ebff298c1775f04722839b918e08f882793e325ca52216a1958ca171973d028d","schema_version":"1.0","event_id":"sha256:ebff298c1775f04722839b918e08f882793e325ca52216a1958ca171973d028d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DL4REL2PMFFNZ6346FABFC36TJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulations in Rank-Based B\\\"uchi Automata Complementation (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ond\\v{r}ej Leng\\'al, Vojt\\v{e}ch Havlena, Yu-Fang Chen","submitted_at":"2019-05-17T07:26:49Z","abstract_excerpt":"Complementation of B\\\"uchi automata is an essential technique used in some approaches for termination analysis of programs. The long search for an optimal complementation construction climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of $(0.76n)^n$, modulo a polynomial factor of $O(n^2)$. Although worst-case optimal, the procedure in many cases produces automata that are unnecessarily large. In this paper, we propose several ways of how to use the direct and delayed simulation relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07139","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.07139/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xpUfqqNlbA62xsTWT0BGuXyYa+Xp3xFu9eBhuUuyTI8WfPkPnb7iD2kFLCc2bvlkaaNx79plMHQmqICO34H2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:34:55.890783Z"},"content_sha256":"9bfe89f0278aaab0a1b983fb55864d02387902bf2039cd6a68b60e31ace9087a","schema_version":"1.0","event_id":"sha256:9bfe89f0278aaab0a1b983fb55864d02387902bf2039cd6a68b60e31ace9087a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DL4REL2PMFFNZ6346FABFC36TJ/bundle.json","state_url":"https://pith.science/pith/DL4REL2PMFFNZ6346FABFC36TJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DL4REL2PMFFNZ6346FABFC36TJ/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-07-06T19:34:55Z","links":{"resolver":"https://pith.science/pith/DL4REL2PMFFNZ6346FABFC36TJ","bundle":"https://pith.science/pith/DL4REL2PMFFNZ6346FABFC36TJ/bundle.json","state":"https://pith.science/pith/DL4REL2PMFFNZ6346FABFC36TJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DL4REL2PMFFNZ6346FABFC36TJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DL4REL2PMFFNZ6346FABFC36TJ","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":"92572658f4f8cb3dcf02df54ef118baaf3ea5cd268d13cbab606407288002cef","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T07:26:49Z","title_canon_sha256":"9bee3fec4242ebdd11e2ea4771f5072510a3255252dcc6a69b96ecbeb7bb0886"},"schema_version":"1.0","source":{"id":"1905.07139","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07139","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07139v2","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07139","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"DL4REL2PMFFN","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"pith_short_16","alias_value":"DL4REL2PMFFNZ634","created_at":"2026-07-05T00:09:50Z"},{"alias_kind":"pith_short_8","alias_value":"DL4REL2P","created_at":"2026-07-05T00:09:50Z"}],"graph_snapshots":[{"event_id":"sha256:9bfe89f0278aaab0a1b983fb55864d02387902bf2039cd6a68b60e31ace9087a","target":"graph","created_at":"2026-07-05T00:09:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.07139/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Complementation of B\\\"uchi automata is an essential technique used in some approaches for termination analysis of programs. The long search for an optimal complementation construction climaxed with the work of Schewe, who proposed a worst-case optimal rank-based procedure that generates complements of a size matching the theoretical lower bound of $(0.76n)^n$, modulo a polynomial factor of $O(n^2)$. Although worst-case optimal, the procedure in many cases produces automata that are unnecessarily large. In this paper, we propose several ways of how to use the direct and delayed simulation relat","authors_text":"Ond\\v{r}ej Leng\\'al, Vojt\\v{e}ch Havlena, Yu-Fang Chen","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T07:26:49Z","title":"Simulations in Rank-Based B\\\"uchi Automata Complementation (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07139","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:ebff298c1775f04722839b918e08f882793e325ca52216a1958ca171973d028d","target":"record","created_at":"2026-07-05T00:09:50Z","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":"92572658f4f8cb3dcf02df54ef118baaf3ea5cd268d13cbab606407288002cef","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-05-17T07:26:49Z","title_canon_sha256":"9bee3fec4242ebdd11e2ea4771f5072510a3255252dcc6a69b96ecbeb7bb0886"},"schema_version":"1.0","source":{"id":"1905.07139","kind":"arxiv","version":2}},"canonical_sha256":"1af9122f4f614adcfb7cf140128b7e9a6348cb4d4044155505d46c91337cc0a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1af9122f4f614adcfb7cf140128b7e9a6348cb4d4044155505d46c91337cc0a4","first_computed_at":"2026-07-05T00:09:50.741692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:09:50.741692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n/PcNUxsXZr3uJh2E5oOfBh6OY/kj2ykv4xdsoU+6MRcqjykmCGAcCOv+QYaRyK/mppSH9vB0Z8Bqe9/Sb2/Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:09:50.742107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07139","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebff298c1775f04722839b918e08f882793e325ca52216a1958ca171973d028d","sha256:9bfe89f0278aaab0a1b983fb55864d02387902bf2039cd6a68b60e31ace9087a"],"state_sha256":"e35044656da89e309caa1be7f0a30cf2c89e4b2ced1eab8bfb01b1f4ebd5ff59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fL3V+BGlxYYvaE7wVTvK274nX3MesBY1A4hO27r9GhKZ5s7XMd/AXrVZOHzS4/YCL380plYdZjJwOa4YtnuXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:34:55.892720Z","bundle_sha256":"3b53fef6b7e0b719d7b12ba4d6362ceb63a7222510f68d25663b021842afafff"}}