{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6GD5ZDEGWGOPS6EM4AAMUXAG6I","short_pith_number":"pith:6GD5ZDEG","schema_version":"1.0","canonical_sha256":"f187dc8c86b19cf9788ce000ca5c06f210f0b0f510e4a195a44036abb6948544","source":{"kind":"arxiv","id":"1301.4529","version":3},"attestation_state":"computed","paper":{"title":"Average-Case Performance of Rollout Algorithms for Knapsack Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Mastin, Patrick Jaillet","submitted_at":"2013-01-19T03:58:34Z","abstract_excerpt":"Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm, a rollout algorithm estimates the value-to-go at each decision stage by simulating future events while following a greedy policy, referred to as the base policy. While in many cases rollout algorithms are guaranteed to perform as well as their base policies, there have been few theoretical results showing additional improvement in performance. In this paper we perform a probabilistic analysis of the subset sum proble"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1301.4529","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-19T03:58:34Z","cross_cats_sorted":[],"title_canon_sha256":"5cdb057592bbfa3e2473e0e7bc1deabe62ed4f6251b88e73b39d5c2d14fa041c","abstract_canon_sha256":"353963469a73da97e65b0b3d32006c96f07b3e604c5d54db50ad31a9b6a07e89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.569788Z","signature_b64":"r6t5tWf5lCxewcKzdu/WOCOkhxoJAQnn5eg9nZ6Yw7fOWzwOLAmTODfRj7xWsxzL2+6A7Xz29vO959l29CrTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f187dc8c86b19cf9788ce000ca5c06f210f0b0f510e4a195a44036abb6948544","last_reissued_at":"2026-05-18T03:06:13.569157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.569157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average-Case Performance of Rollout Algorithms for Knapsack Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Mastin, Patrick Jaillet","submitted_at":"2013-01-19T03:58:34Z","abstract_excerpt":"Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm, a rollout algorithm estimates the value-to-go at each decision stage by simulating future events while following a greedy policy, referred to as the base policy. While in many cases rollout algorithms are guaranteed to perform as well as their base policies, there have been few theoretical results showing additional improvement in performance. In this paper we perform a probabilistic analysis of the subset sum proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4529","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.4529","created_at":"2026-05-18T03:06:13.569252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4529v3","created_at":"2026-05-18T03:06:13.569252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4529","created_at":"2026-05-18T03:06:13.569252+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GD5ZDEGWGOP","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GD5ZDEGWGOPS6EM","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GD5ZDEG","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I","json":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I.json","graph_json":"https://pith.science/api/pith-number/6GD5ZDEGWGOPS6EM4AAMUXAG6I/graph.json","events_json":"https://pith.science/api/pith-number/6GD5ZDEGWGOPS6EM4AAMUXAG6I/events.json","paper":"https://pith.science/paper/6GD5ZDEG"},"agent_actions":{"view_html":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I","download_json":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I.json","view_paper":"https://pith.science/paper/6GD5ZDEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4529&json=true","fetch_graph":"https://pith.science/api/pith-number/6GD5ZDEGWGOPS6EM4AAMUXAG6I/graph.json","fetch_events":"https://pith.science/api/pith-number/6GD5ZDEGWGOPS6EM4AAMUXAG6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I/action/storage_attestation","attest_author":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I/action/author_attestation","sign_citation":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I/action/citation_signature","submit_replication":"https://pith.science/pith/6GD5ZDEGWGOPS6EM4AAMUXAG6I/action/replication_record"}},"created_at":"2026-05-18T03:06:13.569252+00:00","updated_at":"2026-05-18T03:06:13.569252+00:00"}