{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:RH3TJK3YCKSNAWMS4BMCUVBMEY","short_pith_number":"pith:RH3TJK3Y","canonical_record":{"source":{"id":"0805.1391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-05-09T19:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"3e7f54584f1d2ff0697b47442c5255a3f828c1f2527323d891e2daa6ad410bdb","abstract_canon_sha256":"286dabe7fb768011a6c9e54eb66d94bd41720ba3017a4fc656ea342264b08a91"},"schema_version":"1.0"},"canonical_sha256":"89f734ab7812a4d05992e0582a542c262521e75c2c919abfd40c9a37d624428c","source":{"kind":"arxiv","id":"0805.1391","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1391","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1391v1","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1391","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"RH3TJK3YCKSN","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"pith_short_16","alias_value":"RH3TJK3YCKSNAWMS","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"pith_short_8","alias_value":"RH3TJK3Y","created_at":"2026-07-04T15:34:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:RH3TJK3YCKSNAWMS4BMCUVBMEY","target":"record","payload":{"canonical_record":{"source":{"id":"0805.1391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-05-09T19:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"3e7f54584f1d2ff0697b47442c5255a3f828c1f2527323d891e2daa6ad410bdb","abstract_canon_sha256":"286dabe7fb768011a6c9e54eb66d94bd41720ba3017a4fc656ea342264b08a91"},"schema_version":"1.0"},"canonical_sha256":"89f734ab7812a4d05992e0582a542c262521e75c2c919abfd40c9a37d624428c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:34:46.438983Z","signature_b64":"ej50CKMWZkLsf49UlsoRj9rTjovqho+C14S1rXuMwd4j+rXDYgRwVGzS+vTZZ564BPHtq8IxOrahprubwc9+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f734ab7812a4d05992e0582a542c262521e75c2c919abfd40c9a37d624428c","last_reissued_at":"2026-07-04T15:34:46.438610Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:34:46.438610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.1391","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:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ze13xTMOeckcCRsYl5uJkxPWmA8gSAhkLBFevRkQKmi0m5JvFniVrJQGF3EbjZN+yYwTJ5eYJ+SNvfaVUqRsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:32:05.133952Z"},"content_sha256":"124b5d3b8368b7f916ba1b459886ac1b583d1039bb0310245ffdbdf39adae9c8","schema_version":"1.0","event_id":"sha256:124b5d3b8368b7f916ba1b459886ac1b583d1039bb0310245ffdbdf39adae9c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:RH3TJK3YCKSNAWMS4BMCUVBMEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Time Algorithm for Weak Parity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee","submitted_at":"2008-05-09T19:12:30Z","abstract_excerpt":"We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algorithm. We present a linear time algorithm for solving weak-parity games."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1391","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.1391/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:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OdiFzyvpw6fFeU8bJCYyJ70LkdA3CpNC7EDZ4XEi5CNAiZvhQ3pw53zQEpobk+CYWxOVU1EPrGIcdY7TmBKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:32:05.134533Z"},"content_sha256":"e64f1ffa22158f16627116bc8a59af05044c97cc4d5b4e7b69c07a9d7bb538da","schema_version":"1.0","event_id":"sha256:e64f1ffa22158f16627116bc8a59af05044c97cc4d5b4e7b69c07a9d7bb538da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY/bundle.json","state_url":"https://pith.science/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY/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-06T10:32:05Z","links":{"resolver":"https://pith.science/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY","bundle":"https://pith.science/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY/bundle.json","state":"https://pith.science/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RH3TJK3YCKSNAWMS4BMCUVBMEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:RH3TJK3YCKSNAWMS4BMCUVBMEY","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":"286dabe7fb768011a6c9e54eb66d94bd41720ba3017a4fc656ea342264b08a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-05-09T19:12:30Z","title_canon_sha256":"3e7f54584f1d2ff0697b47442c5255a3f828c1f2527323d891e2daa6ad410bdb"},"schema_version":"1.0","source":{"id":"0805.1391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1391","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1391v1","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1391","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"pith_short_12","alias_value":"RH3TJK3YCKSN","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"pith_short_16","alias_value":"RH3TJK3YCKSNAWMS","created_at":"2026-07-04T15:34:46Z"},{"alias_kind":"pith_short_8","alias_value":"RH3TJK3Y","created_at":"2026-07-04T15:34:46Z"}],"graph_snapshots":[{"event_id":"sha256:e64f1ffa22158f16627116bc8a59af05044c97cc4d5b4e7b69c07a9d7bb538da","target":"graph","created_at":"2026-07-04T15:34:46Z","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.1391/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algorithm. We present a linear time algorithm for solving weak-parity games.","authors_text":"Krishnendu Chatterjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-05-09T19:12:30Z","title":"Linear Time Algorithm for Weak Parity Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1391","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:124b5d3b8368b7f916ba1b459886ac1b583d1039bb0310245ffdbdf39adae9c8","target":"record","created_at":"2026-07-04T15:34:46Z","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":"286dabe7fb768011a6c9e54eb66d94bd41720ba3017a4fc656ea342264b08a91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-05-09T19:12:30Z","title_canon_sha256":"3e7f54584f1d2ff0697b47442c5255a3f828c1f2527323d891e2daa6ad410bdb"},"schema_version":"1.0","source":{"id":"0805.1391","kind":"arxiv","version":1}},"canonical_sha256":"89f734ab7812a4d05992e0582a542c262521e75c2c919abfd40c9a37d624428c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89f734ab7812a4d05992e0582a542c262521e75c2c919abfd40c9a37d624428c","first_computed_at":"2026-07-04T15:34:46.438610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:34:46.438610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ej50CKMWZkLsf49UlsoRj9rTjovqho+C14S1rXuMwd4j+rXDYgRwVGzS+vTZZ564BPHtq8IxOrahprubwc9+Dw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:34:46.438983Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.1391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:124b5d3b8368b7f916ba1b459886ac1b583d1039bb0310245ffdbdf39adae9c8","sha256:e64f1ffa22158f16627116bc8a59af05044c97cc4d5b4e7b69c07a9d7bb538da"],"state_sha256":"28a8e743afbe59678dc6115ca9bc7a94224659dcf1f322acfd11f0681722f8f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A68LbViAe5tfbrqsF8LgMVhxalUT3gofYNg9ziI/VdR7uBMu0S4o5dIgMKyfDpnBxFCId5P+dCqdCR2GBAd4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:32:05.140260Z","bundle_sha256":"3c933c6ae100e847abffe7979389901f567769fa94830eb958c9c7e255b7e55e"}}