{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6O26DY4ZHYVCH7GDJKFE2A7K6A","short_pith_number":"pith:6O26DY4Z","canonical_record":{"source":{"id":"1511.08574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-27T07:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"854914098e7208fb6f7a6f10dde1612a37d01a47f04d16e131aceac69e1e0ffe","abstract_canon_sha256":"86a1bd728838e3b2410303d38c8ecd0d0e816aff7bc5ae8db52b45bdb9e3458d"},"schema_version":"1.0"},"canonical_sha256":"f3b5e1e3993e2a23fcc34a8a4d03eaf009d88761aaeffa74cf3bb1b8f528152e","source":{"kind":"arxiv","id":"1511.08574","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08574","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08574v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08574","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"6O26DY4ZHYVC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6O26DY4ZHYVCH7GD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6O26DY4Z","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6O26DY4ZHYVCH7GDJKFE2A7K6A","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-27T07:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"854914098e7208fb6f7a6f10dde1612a37d01a47f04d16e131aceac69e1e0ffe","abstract_canon_sha256":"86a1bd728838e3b2410303d38c8ecd0d0e816aff7bc5ae8db52b45bdb9e3458d"},"schema_version":"1.0"},"canonical_sha256":"f3b5e1e3993e2a23fcc34a8a4d03eaf009d88761aaeffa74cf3bb1b8f528152e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:48.621292Z","signature_b64":"qjDxOZkETjdv+6itbvhROsoxHNZaOa6X06iuaGmfHOo+Iv3hnO4zqjrse6Ck1pg53olZMivzdgsKvcim1P+lAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b5e1e3993e2a23fcc34a8a4d03eaf009d88761aaeffa74cf3bb1b8f528152e","last_reissued_at":"2026-05-18T01:25:48.620820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:48.620820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08574","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-18T01:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+e0L2Rb3y7yBf26t1W101BzS/KyuDZDUCaiBOyPwTcQyu5FreI6E0s4X0fq2BkjCa8htiOb9Coj8fL/jBngBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:09:46.134002Z"},"content_sha256":"2e1689568c34e8e6ce54f373bf94f18f6a199ef63906ea64b06af0ca399b2270","schema_version":"1.0","event_id":"sha256:2e1689568c34e8e6ce54f373bf94f18f6a199ef63906ea64b06af0ca399b2270"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6O26DY4ZHYVCH7GDJKFE2A7K6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stochastic Process Model of Classical Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dimitri Klimenko, Hanna Kurniawati, Marcus Gallagher","submitted_at":"2015-11-27T07:34:41Z","abstract_excerpt":"Among classical search algorithms with the same heuristic information, with sufficient memory A* is essentially as fast as possible in finding a proven optimal solution. However, in many situations optimal solutions are simply infeasible, and thus search algorithms that trade solution quality for speed are desirable. In this paper, we formalize the process of classical search as a metalevel decision problem, the Abstract Search MDP. For any given optimization criterion, this establishes a well-defined notion of the best possible behaviour for a search algorithm and offers a theoretical approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08574","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-18T01:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmMMdqQDMlyAN8LLu3fr8HrbwruxUKzcQdjtbj0TGyUu3tLZ9C51Gu9HRfEWAV3FgUSCZPaoG2K7hgpLTAukAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T18:09:46.134460Z"},"content_sha256":"04f0454ef1cc1273c7e452abacb16461704c4313c2e84a18757820b9e11e3e0c","schema_version":"1.0","event_id":"sha256:04f0454ef1cc1273c7e452abacb16461704c4313c2e84a18757820b9e11e3e0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A/bundle.json","state_url":"https://pith.science/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A/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-05T18:09:46Z","links":{"resolver":"https://pith.science/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A","bundle":"https://pith.science/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A/bundle.json","state":"https://pith.science/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O26DY4ZHYVCH7GDJKFE2A7K6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6O26DY4ZHYVCH7GDJKFE2A7K6A","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":"86a1bd728838e3b2410303d38c8ecd0d0e816aff7bc5ae8db52b45bdb9e3458d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-27T07:34:41Z","title_canon_sha256":"854914098e7208fb6f7a6f10dde1612a37d01a47f04d16e131aceac69e1e0ffe"},"schema_version":"1.0","source":{"id":"1511.08574","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08574","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08574v1","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08574","created_at":"2026-05-18T01:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"6O26DY4ZHYVC","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6O26DY4ZHYVCH7GD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6O26DY4Z","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:04f0454ef1cc1273c7e452abacb16461704c4313c2e84a18757820b9e11e3e0c","target":"graph","created_at":"2026-05-18T01:25:48Z","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":"Among classical search algorithms with the same heuristic information, with sufficient memory A* is essentially as fast as possible in finding a proven optimal solution. However, in many situations optimal solutions are simply infeasible, and thus search algorithms that trade solution quality for speed are desirable. In this paper, we formalize the process of classical search as a metalevel decision problem, the Abstract Search MDP. For any given optimization criterion, this establishes a well-defined notion of the best possible behaviour for a search algorithm and offers a theoretical approac","authors_text":"Dimitri Klimenko, Hanna Kurniawati, Marcus Gallagher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-27T07:34:41Z","title":"A Stochastic Process Model of Classical Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08574","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:2e1689568c34e8e6ce54f373bf94f18f6a199ef63906ea64b06af0ca399b2270","target":"record","created_at":"2026-05-18T01:25:48Z","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":"86a1bd728838e3b2410303d38c8ecd0d0e816aff7bc5ae8db52b45bdb9e3458d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-11-27T07:34:41Z","title_canon_sha256":"854914098e7208fb6f7a6f10dde1612a37d01a47f04d16e131aceac69e1e0ffe"},"schema_version":"1.0","source":{"id":"1511.08574","kind":"arxiv","version":1}},"canonical_sha256":"f3b5e1e3993e2a23fcc34a8a4d03eaf009d88761aaeffa74cf3bb1b8f528152e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3b5e1e3993e2a23fcc34a8a4d03eaf009d88761aaeffa74cf3bb1b8f528152e","first_computed_at":"2026-05-18T01:25:48.620820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:48.620820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qjDxOZkETjdv+6itbvhROsoxHNZaOa6X06iuaGmfHOo+Iv3hnO4zqjrse6Ck1pg53olZMivzdgsKvcim1P+lAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:48.621292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08574","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e1689568c34e8e6ce54f373bf94f18f6a199ef63906ea64b06af0ca399b2270","sha256:04f0454ef1cc1273c7e452abacb16461704c4313c2e84a18757820b9e11e3e0c"],"state_sha256":"e78aeeeb89f050b20b0e1a0e7ff973352e293d9a286e27a9da512639d696ee47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzWfKgNtZ4jSha4mF5DdBmAQfFdrpGOjkZDPaKeaIJJdYhVerBAOCXPzCmtpyrXzfoGG7KEm4qd4REfnHYQxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T18:09:46.136683Z","bundle_sha256":"c3db7693155220cf6c64aab6f403589f1ea466cc5a002f21fe225b64cbee363d"}}