{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JXSLNOB4YVBUE4LI6PEDWXNQGZ","short_pith_number":"pith:JXSLNOB4","canonical_record":{"source":{"id":"1201.2374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-11T18:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"4057b9db68d101d9330d361cee4b27a4c901fd5f45e56c5dfb6afbcbd54b0b44","abstract_canon_sha256":"7ea0523c4e4a425172027d90257ba5c48cbf771b73f6d5916b1e8e1c4aba46af"},"schema_version":"1.0"},"canonical_sha256":"4de4b6b83cc543427168f3c83b5db0364c13f637c5db13af1591e79905b78777","source":{"kind":"arxiv","id":"1201.2374","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2374","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2374v2","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2374","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"pith_short_12","alias_value":"JXSLNOB4YVBU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JXSLNOB4YVBUE4LI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JXSLNOB4","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JXSLNOB4YVBUE4LI6PEDWXNQGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-11T18:42:46Z","cross_cats_sorted":[],"title_canon_sha256":"4057b9db68d101d9330d361cee4b27a4c901fd5f45e56c5dfb6afbcbd54b0b44","abstract_canon_sha256":"7ea0523c4e4a425172027d90257ba5c48cbf771b73f6d5916b1e8e1c4aba46af"},"schema_version":"1.0"},"canonical_sha256":"4de4b6b83cc543427168f3c83b5db0364c13f637c5db13af1591e79905b78777","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:11.951236Z","signature_b64":"RN3yhbCERqaXU2AueeB2jDz3g0hHj8weeL0IwAGu7zdBAq4CHZXJj26aO5K7JWQ9SRVNsEsVDuQYyt0ZGrxCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4de4b6b83cc543427168f3c83b5db0364c13f637c5db13af1591e79905b78777","last_reissued_at":"2026-05-18T03:33:11.950327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:11.950327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2374","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-18T03:33:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+t8Y/FPt3FfksQMwV36+VEArp7SZ3Gx3XEzATLo1DuFUJoZBycSTXKB7BeQcSn/Xtb8W1/AGYauq4EfODLJ3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:00:25.486892Z"},"content_sha256":"442ebf86165aacb56490f37ea640e92f0646af985a226e5c6129cae4a537c38f","schema_version":"1.0","event_id":"sha256:442ebf86165aacb56490f37ea640e92f0646af985a226e5c6129cae4a537c38f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JXSLNOB4YVBUE4LI6PEDWXNQGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","submitted_at":"2012-01-11T18:42:46Z","abstract_excerpt":"We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\\epsilon), where \\epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.)\n  We use this result to resolve several open problems regarding the computational complexity of computing key quantities associated with some classic and heavily studied stochastic processes, including multi-type branching process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2374","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-18T03:33:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsZN18MhWVEecJ+9+ligEJ/QISD7SUOA1clg+9CukCsuTDwYqunaKafQRqPLasqUGGfkLD+pTFpVGCMWitIyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T23:00:25.487234Z"},"content_sha256":"3908e136a932ecff9c0fb796cc21b64e313ab090ee1e6305485a28bc3cc2e23a","schema_version":"1.0","event_id":"sha256:3908e136a932ecff9c0fb796cc21b64e313ab090ee1e6305485a28bc3cc2e23a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ/bundle.json","state_url":"https://pith.science/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ/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-20T23:00:25Z","links":{"resolver":"https://pith.science/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ","bundle":"https://pith.science/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ/bundle.json","state":"https://pith.science/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXSLNOB4YVBUE4LI6PEDWXNQGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JXSLNOB4YVBUE4LI6PEDWXNQGZ","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":"7ea0523c4e4a425172027d90257ba5c48cbf771b73f6d5916b1e8e1c4aba46af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-11T18:42:46Z","title_canon_sha256":"4057b9db68d101d9330d361cee4b27a4c901fd5f45e56c5dfb6afbcbd54b0b44"},"schema_version":"1.0","source":{"id":"1201.2374","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2374","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2374v2","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2374","created_at":"2026-05-18T03:33:11Z"},{"alias_kind":"pith_short_12","alias_value":"JXSLNOB4YVBU","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JXSLNOB4YVBUE4LI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JXSLNOB4","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:3908e136a932ecff9c0fb796cc21b64e313ab090ee1e6305485a28bc3cc2e23a","target":"graph","created_at":"2026-05-18T03:33:11Z","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":"We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\\epsilon), where \\epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.)\n  We use this result to resolve several open problems regarding the computational complexity of computing key quantities associated with some classic and heavily studied stochastic processes, including multi-type branching process","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-11T18:42:46Z","title":"Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2374","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:442ebf86165aacb56490f37ea640e92f0646af985a226e5c6129cae4a537c38f","target":"record","created_at":"2026-05-18T03:33:11Z","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":"7ea0523c4e4a425172027d90257ba5c48cbf771b73f6d5916b1e8e1c4aba46af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-11T18:42:46Z","title_canon_sha256":"4057b9db68d101d9330d361cee4b27a4c901fd5f45e56c5dfb6afbcbd54b0b44"},"schema_version":"1.0","source":{"id":"1201.2374","kind":"arxiv","version":2}},"canonical_sha256":"4de4b6b83cc543427168f3c83b5db0364c13f637c5db13af1591e79905b78777","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4de4b6b83cc543427168f3c83b5db0364c13f637c5db13af1591e79905b78777","first_computed_at":"2026-05-18T03:33:11.950327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:11.950327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RN3yhbCERqaXU2AueeB2jDz3g0hHj8weeL0IwAGu7zdBAq4CHZXJj26aO5K7JWQ9SRVNsEsVDuQYyt0ZGrxCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:11.951236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2374","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:442ebf86165aacb56490f37ea640e92f0646af985a226e5c6129cae4a537c38f","sha256:3908e136a932ecff9c0fb796cc21b64e313ab090ee1e6305485a28bc3cc2e23a"],"state_sha256":"dccc8db4d2e0132ff7038827165bb57ea5aba96850789b7a4f31bdf4937fd29e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiGCC1H9GfiRYd6f2yMniFXe0LRCXKfMwV4nv6LLEi7MKFTrav4kNSp8zZM9AxOjhJjqpQ2H7wvZrYJMB//sDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T23:00:25.489131Z","bundle_sha256":"30bc994f820f35160132f6fef933fe0eb769e801e008695578b4fde4e7d9043c"}}