{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:THW2BXGLRKOZDM6KXDQDLI2SH4","short_pith_number":"pith:THW2BXGL","canonical_record":{"source":{"id":"0805.2620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-05-16T20:38:54Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9449d426e0d394733fa998033e1c5cd3746e0716234cc0493d5485a1b42651d7","abstract_canon_sha256":"a1747f3c109b73f101ca9f088820a6cb06afca7f62626065c0b691436665955f"},"schema_version":"1.0"},"canonical_sha256":"99eda0dccb8a9d91b3cab8e035a3523f110cf5f1d1a28b917649b2ce64fec488","source":{"kind":"arxiv","id":"0805.2620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.2620","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"0805.2620v1","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2620","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"THW2BXGLRKOZ","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"pith_short_16","alias_value":"THW2BXGLRKOZDM6K","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"pith_short_8","alias_value":"THW2BXGL","created_at":"2026-07-04T15:34:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:THW2BXGLRKOZDM6KXDQDLI2SH4","target":"record","payload":{"canonical_record":{"source":{"id":"0805.2620","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-05-16T20:38:54Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9449d426e0d394733fa998033e1c5cd3746e0716234cc0493d5485a1b42651d7","abstract_canon_sha256":"a1747f3c109b73f101ca9f088820a6cb06afca7f62626065c0b691436665955f"},"schema_version":"1.0"},"canonical_sha256":"99eda0dccb8a9d91b3cab8e035a3523f110cf5f1d1a28b917649b2ce64fec488","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:34:47.603079Z","signature_b64":"REWuxZKhFAVnkxjpZ0yEWQZGLQydyBJ8T9jYJNKdYA4zHxq7MrWa+No/UX7zv26WmSPw9HgWeMsrJ6VIZ1Y3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99eda0dccb8a9d91b3cab8e035a3523f110cf5f1d1a28b917649b2ce64fec488","last_reissued_at":"2026-07-04T15:34:47.602702Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:34:47.602702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.2620","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-07-04T15:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deHqdnXBg99hTV61wKnZXH1GUtwkPrKzh4+dBsjfVckKPspMB5URX7cRJxsuE+1w8e89eEfzegrh1h2lkxeuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:26:40.318327Z"},"content_sha256":"2c458a7a81bcf7db063bd4da243310c13c2817b39a22774b1fb881494536b41a","schema_version":"1.0","event_id":"sha256:2c458a7a81bcf7db063bd4da243310c13c2817b39a22774b1fb881494536b41a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:THW2BXGLRKOZDM6KXDQDLI2SH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for B\\\"uchi Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Nir Piterman, Thomas A. Henzinger","submitted_at":"2008-05-16T20:38:54Z","abstract_excerpt":"The classical algorithm for solving B\\\"uchi games requires time $O(n\\cdot m)$ for game graphs with $n$ states and $m$ edges. For game graphs with constant outdegree, the best known algorithm has running time $O(n^2/\\log n)$. We present two new algorithms for B\\\"uchi games. First, we give an algorithm that performs at most $O(m)$ more work than the classical algorithm, but runs in time O(n) on infinitely many graphs of constant outdegree on which the classical algorithm requires time $O(n^2)$. Second, we give an algorithm with running time $O(n\\cdot m\\cdot\\log\\delta(n)/\\log n)$, where $1\\le\\del"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2620","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0805.2620/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-04T15:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3z4fCxYQ8iPwZXp0GngiMkO8l5faRyEhS9uLV8VS/5kiFzx5BF+79BY6Sh8doS22PsEJd/BRu88T8B3bIKbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T11:26:40.321836Z"},"content_sha256":"b59ff9be611e50ba4ea164d7b6a3b14e04fa21514f2c343b0e410bbbdf6c5278","schema_version":"1.0","event_id":"sha256:b59ff9be611e50ba4ea164d7b6a3b14e04fa21514f2c343b0e410bbbdf6c5278"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THW2BXGLRKOZDM6KXDQDLI2SH4/bundle.json","state_url":"https://pith.science/pith/THW2BXGLRKOZDM6KXDQDLI2SH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THW2BXGLRKOZDM6KXDQDLI2SH4/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-08-06T11:26:40Z","links":{"resolver":"https://pith.science/pith/THW2BXGLRKOZDM6KXDQDLI2SH4","bundle":"https://pith.science/pith/THW2BXGLRKOZDM6KXDQDLI2SH4/bundle.json","state":"https://pith.science/pith/THW2BXGLRKOZDM6KXDQDLI2SH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THW2BXGLRKOZDM6KXDQDLI2SH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:THW2BXGLRKOZDM6KXDQDLI2SH4","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":"a1747f3c109b73f101ca9f088820a6cb06afca7f62626065c0b691436665955f","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-05-16T20:38:54Z","title_canon_sha256":"9449d426e0d394733fa998033e1c5cd3746e0716234cc0493d5485a1b42651d7"},"schema_version":"1.0","source":{"id":"0805.2620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.2620","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"0805.2620v1","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.2620","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"THW2BXGLRKOZ","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"pith_short_16","alias_value":"THW2BXGLRKOZDM6K","created_at":"2026-07-04T15:34:47Z"},{"alias_kind":"pith_short_8","alias_value":"THW2BXGL","created_at":"2026-07-04T15:34:47Z"}],"graph_snapshots":[{"event_id":"sha256:b59ff9be611e50ba4ea164d7b6a3b14e04fa21514f2c343b0e410bbbdf6c5278","target":"graph","created_at":"2026-07-04T15:34:47Z","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/0805.2620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The classical algorithm for solving B\\\"uchi games requires time $O(n\\cdot m)$ for game graphs with $n$ states and $m$ edges. For game graphs with constant outdegree, the best known algorithm has running time $O(n^2/\\log n)$. We present two new algorithms for B\\\"uchi games. First, we give an algorithm that performs at most $O(m)$ more work than the classical algorithm, but runs in time O(n) on infinitely many graphs of constant outdegree on which the classical algorithm requires time $O(n^2)$. Second, we give an algorithm with running time $O(n\\cdot m\\cdot\\log\\delta(n)/\\log n)$, where $1\\le\\del","authors_text":"Krishnendu Chatterjee, Nir Piterman, Thomas A. Henzinger","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-05-16T20:38:54Z","title":"Algorithms for B\\\"uchi Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.2620","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:2c458a7a81bcf7db063bd4da243310c13c2817b39a22774b1fb881494536b41a","target":"record","created_at":"2026-07-04T15:34:47Z","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":"a1747f3c109b73f101ca9f088820a6cb06afca7f62626065c0b691436665955f","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-05-16T20:38:54Z","title_canon_sha256":"9449d426e0d394733fa998033e1c5cd3746e0716234cc0493d5485a1b42651d7"},"schema_version":"1.0","source":{"id":"0805.2620","kind":"arxiv","version":1}},"canonical_sha256":"99eda0dccb8a9d91b3cab8e035a3523f110cf5f1d1a28b917649b2ce64fec488","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99eda0dccb8a9d91b3cab8e035a3523f110cf5f1d1a28b917649b2ce64fec488","first_computed_at":"2026-07-04T15:34:47.602702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:34:47.602702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"REWuxZKhFAVnkxjpZ0yEWQZGLQydyBJ8T9jYJNKdYA4zHxq7MrWa+No/UX7zv26WmSPw9HgWeMsrJ6VIZ1Y3DQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:34:47.603079Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.2620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c458a7a81bcf7db063bd4da243310c13c2817b39a22774b1fb881494536b41a","sha256:b59ff9be611e50ba4ea164d7b6a3b14e04fa21514f2c343b0e410bbbdf6c5278"],"state_sha256":"54f7c5d76834dde4c167f0cfd9274427eb4601f2df600d1820bd4be79253b864"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awixcQHrEL8Fg896aIu/I9TTUwDL5+BU9oymztooTaF78S+3wpy6L4oaiqq31RNmi94KhTTImRTtydrtO2DsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T11:26:40.330619Z","bundle_sha256":"d0d92f67edb53f85040535348a46b9082da48c3e70be154ab03bf7506f2c538a"}}