{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OFRUMB3MQVB4S25PHJ35EIT7J2","short_pith_number":"pith:OFRUMB3M","canonical_record":{"source":{"id":"1601.03411","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-13T21:17:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a2f1e65e77291cf333c00c6e6bc8916d0eb17c36c6f2dfe85ddce8a7d3dccd05","abstract_canon_sha256":"563956b43fca33f3e83b0ee77b270e02f0d2957c03c88e2ed01e7c0dd5b67ff3"},"schema_version":"1.0"},"canonical_sha256":"716346076c8543c96baf3a77d2227f4eb672b7a4330b77d63dc5335ff335fd67","source":{"kind":"arxiv","id":"1601.03411","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03411","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03411v5","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03411","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"OFRUMB3MQVB4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFRUMB3MQVB4S25P","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFRUMB3M","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OFRUMB3MQVB4S25PHJ35EIT7J2","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03411","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-13T21:17:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a2f1e65e77291cf333c00c6e6bc8916d0eb17c36c6f2dfe85ddce8a7d3dccd05","abstract_canon_sha256":"563956b43fca33f3e83b0ee77b270e02f0d2957c03c88e2ed01e7c0dd5b67ff3"},"schema_version":"1.0"},"canonical_sha256":"716346076c8543c96baf3a77d2227f4eb672b7a4330b77d63dc5335ff335fd67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:36.644244Z","signature_b64":"U+f6Rvt3h4xuezdNhR9yDO0mfyUQFxu+1xCsnS3N+1LGOtdbcEcNBCFNSyX7uGngaPkgiwqXwb9hNE6ddYSnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716346076c8543c96baf3a77d2227f4eb672b7a4330b77d63dc5335ff335fd67","last_reissued_at":"2026-05-18T00:38:36.643609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:36.643609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03411","source_version":5,"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-18T00:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f3amSzZwZlOMoUUAjF/rzVwwj6wvj/5FrZxvbQTMP0w6O7S1YeBWLu19A7DbJNFARHxrc9s0VMuO2L3OsFHaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:27:56.621043Z"},"content_sha256":"896c106c3f1ee92461e4ee9ea890e86732a54b2857d082b61b3f4281708761aa","schema_version":"1.0","event_id":"sha256:896c106c3f1ee92461e4ee9ea890e86732a54b2857d082b61b3f4281708761aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OFRUMB3MQVB4S25PHJ35EIT7J2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Algorithms and Partial Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Andrew MacFie","submitted_at":"2016-01-13T21:17:42Z","abstract_excerpt":"We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and automated theorem proving. We mention an approach to self-improving AGI enabled by this methodology.\n  Aug 2017 addendum: This article was originally written with multiple audiences in mind. It is really best put in the following terms. Goertzel, Hutter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03411","kind":"arxiv","version":5},"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-18T00:38:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9ozfXR3D1FJA3V+Wf1rsi9P+Ew3ZrL/GkZFEr8HUVvloTYRUWsM7WvmodeRp6bWRMVhbiK6xlRq/lPXixgkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T06:27:56.621398Z"},"content_sha256":"a7fc3747a0f7be8916c3a39a4613dc780165ca44b2ee97a29452785ca8c4e6da","schema_version":"1.0","event_id":"sha256:a7fc3747a0f7be8916c3a39a4613dc780165ca44b2ee97a29452785ca8c4e6da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFRUMB3MQVB4S25PHJ35EIT7J2/bundle.json","state_url":"https://pith.science/pith/OFRUMB3MQVB4S25PHJ35EIT7J2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFRUMB3MQVB4S25PHJ35EIT7J2/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-02T06:27:56Z","links":{"resolver":"https://pith.science/pith/OFRUMB3MQVB4S25PHJ35EIT7J2","bundle":"https://pith.science/pith/OFRUMB3MQVB4S25PHJ35EIT7J2/bundle.json","state":"https://pith.science/pith/OFRUMB3MQVB4S25PHJ35EIT7J2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFRUMB3MQVB4S25PHJ35EIT7J2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OFRUMB3MQVB4S25PHJ35EIT7J2","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":"563956b43fca33f3e83b0ee77b270e02f0d2957c03c88e2ed01e7c0dd5b67ff3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-13T21:17:42Z","title_canon_sha256":"a2f1e65e77291cf333c00c6e6bc8916d0eb17c36c6f2dfe85ddce8a7d3dccd05"},"schema_version":"1.0","source":{"id":"1601.03411","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03411","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03411v5","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03411","created_at":"2026-05-18T00:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"OFRUMB3MQVB4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OFRUMB3MQVB4S25P","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OFRUMB3M","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:a7fc3747a0f7be8916c3a39a4613dc780165ca44b2ee97a29452785ca8c4e6da","target":"graph","created_at":"2026-05-18T00:38:36Z","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 present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and automated theorem proving. We mention an approach to self-improving AGI enabled by this methodology.\n  Aug 2017 addendum: This article was originally written with multiple audiences in mind. It is really best put in the following terms. Goertzel, Hutter","authors_text":"Andrew MacFie","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-13T21:17:42Z","title":"Analysis of Algorithms and Partial Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03411","kind":"arxiv","version":5},"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:896c106c3f1ee92461e4ee9ea890e86732a54b2857d082b61b3f4281708761aa","target":"record","created_at":"2026-05-18T00:38:36Z","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":"563956b43fca33f3e83b0ee77b270e02f0d2957c03c88e2ed01e7c0dd5b67ff3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-01-13T21:17:42Z","title_canon_sha256":"a2f1e65e77291cf333c00c6e6bc8916d0eb17c36c6f2dfe85ddce8a7d3dccd05"},"schema_version":"1.0","source":{"id":"1601.03411","kind":"arxiv","version":5}},"canonical_sha256":"716346076c8543c96baf3a77d2227f4eb672b7a4330b77d63dc5335ff335fd67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"716346076c8543c96baf3a77d2227f4eb672b7a4330b77d63dc5335ff335fd67","first_computed_at":"2026-05-18T00:38:36.643609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:36.643609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U+f6Rvt3h4xuezdNhR9yDO0mfyUQFxu+1xCsnS3N+1LGOtdbcEcNBCFNSyX7uGngaPkgiwqXwb9hNE6ddYSnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:36.644244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03411","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:896c106c3f1ee92461e4ee9ea890e86732a54b2857d082b61b3f4281708761aa","sha256:a7fc3747a0f7be8916c3a39a4613dc780165ca44b2ee97a29452785ca8c4e6da"],"state_sha256":"c7114ff886014d61a46a684a179db0850c776300ae1bead3737fa3cb7dd517c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7whp+FJXNK4g0QP7b50sz2ABTvyVE3I+lhemdRzDr/3hSDu8kQmBuQySV3auVz/IHGug6vNLhJn+fPAGlrlkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T06:27:56.623330Z","bundle_sha256":"e6c3f21830d5958f25538462322111af65af2c55e1d4286b367d36bab4655bb4"}}