{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SH7OJNZ67NSQQOWDVFMDSBITLA","short_pith_number":"pith:SH7OJNZ6","schema_version":"1.0","canonical_sha256":"91fee4b73efb65083ac3a958390513581afe5fb27357aac1289ec222ff31c292","source":{"kind":"arxiv","id":"1608.03647","version":2},"attestation_state":"computed","paper":{"title":"Learning with Value-Ramp","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jan Van den Bussche, Tom J. Ameloot","submitted_at":"2016-08-12T07:24:57Z","abstract_excerpt":"We study a learning principle based on the intuition of forming ramps. The agent tries to follow an increasing sequence of values until the agent meets a peak of reward. The resulting Value-Ramp algorithm is natural, easy to configure, and has a robust implementation with natural numbers."},"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":"1608.03647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-12T07:24:57Z","cross_cats_sorted":[],"title_canon_sha256":"efeb7590299afe8653c8bef2795dc958bb6a4259e58e6795a37e27cc05cdaf96","abstract_canon_sha256":"39fb49f92c02de5ee597b5e54a4a01586bc0c9f56b922ed1797334bf80c8b391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:58.688716Z","signature_b64":"8w4j7Blp4g5z8U8lJmHzba9pzx1g4QVHdD1Y0k5V6JM5Uvf4mF768IlazI9BLAukkKZIVHCbUMY8nbtWr7neAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91fee4b73efb65083ac3a958390513581afe5fb27357aac1289ec222ff31c292","last_reissued_at":"2026-05-18T00:45:58.688259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:58.688259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning with Value-Ramp","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jan Van den Bussche, Tom J. Ameloot","submitted_at":"2016-08-12T07:24:57Z","abstract_excerpt":"We study a learning principle based on the intuition of forming ramps. The agent tries to follow an increasing sequence of values until the agent meets a peak of reward. The resulting Value-Ramp algorithm is natural, easy to configure, and has a robust implementation with natural numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03647","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.03647","created_at":"2026-05-18T00:45:58.688327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03647v2","created_at":"2026-05-18T00:45:58.688327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03647","created_at":"2026-05-18T00:45:58.688327+00:00"},{"alias_kind":"pith_short_12","alias_value":"SH7OJNZ67NSQ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SH7OJNZ67NSQQOWD","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SH7OJNZ6","created_at":"2026-05-18T12:30:44.179134+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/SH7OJNZ67NSQQOWDVFMDSBITLA","json":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA.json","graph_json":"https://pith.science/api/pith-number/SH7OJNZ67NSQQOWDVFMDSBITLA/graph.json","events_json":"https://pith.science/api/pith-number/SH7OJNZ67NSQQOWDVFMDSBITLA/events.json","paper":"https://pith.science/paper/SH7OJNZ6"},"agent_actions":{"view_html":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA","download_json":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA.json","view_paper":"https://pith.science/paper/SH7OJNZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03647&json=true","fetch_graph":"https://pith.science/api/pith-number/SH7OJNZ67NSQQOWDVFMDSBITLA/graph.json","fetch_events":"https://pith.science/api/pith-number/SH7OJNZ67NSQQOWDVFMDSBITLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA/action/storage_attestation","attest_author":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA/action/author_attestation","sign_citation":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA/action/citation_signature","submit_replication":"https://pith.science/pith/SH7OJNZ67NSQQOWDVFMDSBITLA/action/replication_record"}},"created_at":"2026-05-18T00:45:58.688327+00:00","updated_at":"2026-05-18T00:45:58.688327+00:00"}