{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5I3GLMQYH2B4GWCO2OJDR4A4SP","short_pith_number":"pith:5I3GLMQY","canonical_record":{"source":{"id":"1301.2302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"aadb1d1aeb298998d5a551f9ac935e3a1f9d1b2bddb21bb1e61e2e82f8c27f91","abstract_canon_sha256":"a2e1e26cb036229e85bb79530a0575d7fedf9045d8ce2f39566114b3511eff22"},"schema_version":"1.0"},"canonical_sha256":"ea3665b2183e83c3584ed39238f01c93e04cb7a3dc9df14b5dc9964fc50cded1","source":{"kind":"arxiv","id":"1301.2302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2302","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2302v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2302","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"5I3GLMQYH2B4","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5I3GLMQYH2B4GWCO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5I3GLMQY","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5I3GLMQYH2B4GWCO2OJDR4A4SP","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"aadb1d1aeb298998d5a551f9ac935e3a1f9d1b2bddb21bb1e61e2e82f8c27f91","abstract_canon_sha256":"a2e1e26cb036229e85bb79530a0575d7fedf9045d8ce2f39566114b3511eff22"},"schema_version":"1.0"},"canonical_sha256":"ea3665b2183e83c3584ed39238f01c93e04cb7a3dc9df14b5dc9964fc50cded1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.451608Z","signature_b64":"F8hgMaGxBrzO0kH/IqDhhHmYrqWFS19WcA0UQuGC7QrpwUedo63hx8Mtlhh7+oFcF1AqQdGZkCwsIND2NYmAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea3665b2183e83c3584ed39238f01c93e04cb7a3dc9df14b5dc9964fc50cded1","last_reissued_at":"2026-05-18T03:36:45.450880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.450880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2302","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-05-18T03:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzraWpTpfj4BCB6GXIptQ5HugnzU8x1jbsUQTILJ9+lF6ntZUsf7L+2IIDTHGQ0d2LE2ilKoNCM6FS9KI17gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:19.455829Z"},"content_sha256":"74eed1edacfead76b2f017f811b37817eb84847c746875779a18cdf8e235d37b","schema_version":"1.0","event_id":"sha256:74eed1edacfead76b2f017f811b37817eb84847c746875779a18cdf8e235d37b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5I3GLMQYH2B4GWCO2OJDR4A4SP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toward General Analysis of Recursive Probability Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daniel Pless, George Luger","submitted_at":"2013-01-10T16:25:55Z","abstract_excerpt":"There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be intractable for many nonrecursive models and impossible in the general case for recursive problems, several research groups are actively developing computational techniques for recursive stochastic languages. We have developed an extension to the traditional lambda-calculus as a framework for families of Turing complete stochastic languages. We have also deve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2302","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":""},"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:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVpa2KaeipPr3wK3hFqIl4scIOXrh5CKvegwCciES+9NhFbW35tKfXA/+ZRU4nq6nYd+7NiMl6m3dsW5t2K9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:19.456551Z"},"content_sha256":"8da3c0170af54ec112e99e94583638246f445fb95ff84146d09e7f73caff01cf","schema_version":"1.0","event_id":"sha256:8da3c0170af54ec112e99e94583638246f445fb95ff84146d09e7f73caff01cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP/bundle.json","state_url":"https://pith.science/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP/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-11T22:08:19Z","links":{"resolver":"https://pith.science/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP","bundle":"https://pith.science/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP/bundle.json","state":"https://pith.science/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5I3GLMQYH2B4GWCO2OJDR4A4SP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5I3GLMQYH2B4GWCO2OJDR4A4SP","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":"a2e1e26cb036229e85bb79530a0575d7fedf9045d8ce2f39566114b3511eff22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:55Z","title_canon_sha256":"aadb1d1aeb298998d5a551f9ac935e3a1f9d1b2bddb21bb1e61e2e82f8c27f91"},"schema_version":"1.0","source":{"id":"1301.2302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2302","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2302v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2302","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"5I3GLMQYH2B4","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5I3GLMQYH2B4GWCO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5I3GLMQY","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:8da3c0170af54ec112e99e94583638246f445fb95ff84146d09e7f73caff01cf","target":"graph","created_at":"2026-05-18T03:36:45Z","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":"There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be intractable for many nonrecursive models and impossible in the general case for recursive problems, several research groups are actively developing computational techniques for recursive stochastic languages. We have developed an extension to the traditional lambda-calculus as a framework for families of Turing complete stochastic languages. We have also deve","authors_text":"Daniel Pless, George Luger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:55Z","title":"Toward General Analysis of Recursive Probability Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2302","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:74eed1edacfead76b2f017f811b37817eb84847c746875779a18cdf8e235d37b","target":"record","created_at":"2026-05-18T03:36:45Z","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":"a2e1e26cb036229e85bb79530a0575d7fedf9045d8ce2f39566114b3511eff22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:25:55Z","title_canon_sha256":"aadb1d1aeb298998d5a551f9ac935e3a1f9d1b2bddb21bb1e61e2e82f8c27f91"},"schema_version":"1.0","source":{"id":"1301.2302","kind":"arxiv","version":1}},"canonical_sha256":"ea3665b2183e83c3584ed39238f01c93e04cb7a3dc9df14b5dc9964fc50cded1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea3665b2183e83c3584ed39238f01c93e04cb7a3dc9df14b5dc9964fc50cded1","first_computed_at":"2026-05-18T03:36:45.450880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.450880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8hgMaGxBrzO0kH/IqDhhHmYrqWFS19WcA0UQuGC7QrpwUedo63hx8Mtlhh7+oFcF1AqQdGZkCwsIND2NYmAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.451608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74eed1edacfead76b2f017f811b37817eb84847c746875779a18cdf8e235d37b","sha256:8da3c0170af54ec112e99e94583638246f445fb95ff84146d09e7f73caff01cf"],"state_sha256":"74096f50a1e78adb310e4bc9b871b54a62901cc4e20e3f51dcd776c86e9ed4ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6M2tY6eNPHwstHvpRwAXWgQfK8kTETOhjK3LRQHwWT6+xCEtPUJz57SHMryc8yFlhDAalJ2Q/6vq3F9wJ+yYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:08:19.460907Z","bundle_sha256":"694b3944ad10957d4441f53634f7e8c47a92a93d37c2f8383f333e44e08442e9"}}