{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CI7Q5AC3UGL367A4FS6ME4VEZO","short_pith_number":"pith:CI7Q5AC3","canonical_record":{"source":{"id":"1712.01856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-05T19:00:11Z","cross_cats_sorted":["cs.HC","cs.SI"],"title_canon_sha256":"cd1d3dcca3509e6d3f987440416f177ac8a2d178611f19b4fb15dce3c3cb3bd1","abstract_canon_sha256":"68d813aa6b1aa9b4d6612852b8a19fdd992e150ea276f2dd39c1484be0543e8f"},"schema_version":"1.0"},"canonical_sha256":"123f0e805ba197bf7c1c2cbcc272a4cbb64781cfdd6e2bb0ccbc0b32f3e62dfb","source":{"kind":"arxiv","id":"1712.01856","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01856","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01856v2","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01856","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"CI7Q5AC3UGL3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CI7Q5AC3UGL367A4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CI7Q5AC3","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CI7Q5AC3UGL367A4FS6ME4VEZO","target":"record","payload":{"canonical_record":{"source":{"id":"1712.01856","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-05T19:00:11Z","cross_cats_sorted":["cs.HC","cs.SI"],"title_canon_sha256":"cd1d3dcca3509e6d3f987440416f177ac8a2d178611f19b4fb15dce3c3cb3bd1","abstract_canon_sha256":"68d813aa6b1aa9b4d6612852b8a19fdd992e150ea276f2dd39c1484be0543e8f"},"schema_version":"1.0"},"canonical_sha256":"123f0e805ba197bf7c1c2cbcc272a4cbb64781cfdd6e2bb0ccbc0b32f3e62dfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:34.453932Z","signature_b64":"Uu02n5TB1RO0wEwFATodkpg9F5qNKz9XUAsCLuF8sjk4N550UTtzkTL5u51pZCBQGy9U/wDZqn5D13F3mGtXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"123f0e805ba197bf7c1c2cbcc272a4cbb64781cfdd6e2bb0ccbc0b32f3e62dfb","last_reissued_at":"2026-05-18T00:21:34.453288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:34.453288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.01856","source_version":2,"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:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMFLehZz+9FeJtEc4zemO0cMBEllHpoR8/l0JbgOR0qbe+0nmoVTop/AsrUu7NKbFM+NDWXZNTZCZBrQqMPyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:05.467926Z"},"content_sha256":"5a933c9c4810d37466fb1519349a02bec0c1452bcd2a844be52b79d2dba7e03f","schema_version":"1.0","event_id":"sha256:5a933c9c4810d37466fb1519349a02bec0c1452bcd2a844be52b79d2dba7e03f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CI7Q5AC3UGL367A4FS6ME4VEZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Human Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.SI"],"primary_cat":"stat.ML","authors_text":"Abir De, Ali Zarezade, Behzad Tabibian, Bernhard Schoelkopf, Manuel Gomez-Rodriguez, Utkarsh Upadhyay","submitted_at":"2017-12-05T19:00:11Z","abstract_excerpt":"Spaced repetition is a technique for efficient memorization which uses repeated, spaced review of content to improve long-term retention. Can we find the optimal reviewing schedule to maximize the benefits of spaced repetition? In this paper, we introduce a novel, flexible representation of spaced repetition using the framework of marked temporal point processes and then address the above question as an optimal control problem for stochastic differential equations with jumps. For two well-known human memory models, we show that the optimal reviewing schedule is given by the recall probability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01856","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"},"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:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25N9hVaHD9nEpaPzrVdfEXOsrLW8XkK4iRdwJOpNecUzjBc+U8lPA5ujeeQSEfO9FVWPf55vVmw5ns0DCG9aDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:05.468548Z"},"content_sha256":"4f94949df46f817d534734158a316d684c7d81580959b3f0e781fac207815893","schema_version":"1.0","event_id":"sha256:4f94949df46f817d534734158a316d684c7d81580959b3f0e781fac207815893"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CI7Q5AC3UGL367A4FS6ME4VEZO/bundle.json","state_url":"https://pith.science/pith/CI7Q5AC3UGL367A4FS6ME4VEZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CI7Q5AC3UGL367A4FS6ME4VEZO/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-05-27T22:11:05Z","links":{"resolver":"https://pith.science/pith/CI7Q5AC3UGL367A4FS6ME4VEZO","bundle":"https://pith.science/pith/CI7Q5AC3UGL367A4FS6ME4VEZO/bundle.json","state":"https://pith.science/pith/CI7Q5AC3UGL367A4FS6ME4VEZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CI7Q5AC3UGL367A4FS6ME4VEZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CI7Q5AC3UGL367A4FS6ME4VEZO","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":"68d813aa6b1aa9b4d6612852b8a19fdd992e150ea276f2dd39c1484be0543e8f","cross_cats_sorted":["cs.HC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-05T19:00:11Z","title_canon_sha256":"cd1d3dcca3509e6d3f987440416f177ac8a2d178611f19b4fb15dce3c3cb3bd1"},"schema_version":"1.0","source":{"id":"1712.01856","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01856","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01856v2","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01856","created_at":"2026-05-18T00:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"CI7Q5AC3UGL3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CI7Q5AC3UGL367A4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CI7Q5AC3","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:4f94949df46f817d534734158a316d684c7d81580959b3f0e781fac207815893","target":"graph","created_at":"2026-05-18T00:21:34Z","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":"Spaced repetition is a technique for efficient memorization which uses repeated, spaced review of content to improve long-term retention. Can we find the optimal reviewing schedule to maximize the benefits of spaced repetition? In this paper, we introduce a novel, flexible representation of spaced repetition using the framework of marked temporal point processes and then address the above question as an optimal control problem for stochastic differential equations with jumps. For two well-known human memory models, we show that the optimal reviewing schedule is given by the recall probability ","authors_text":"Abir De, Ali Zarezade, Behzad Tabibian, Bernhard Schoelkopf, Manuel Gomez-Rodriguez, Utkarsh Upadhyay","cross_cats":["cs.HC","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-05T19:00:11Z","title":"Optimizing Human Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01856","kind":"arxiv","version":2},"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:5a933c9c4810d37466fb1519349a02bec0c1452bcd2a844be52b79d2dba7e03f","target":"record","created_at":"2026-05-18T00:21:34Z","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":"68d813aa6b1aa9b4d6612852b8a19fdd992e150ea276f2dd39c1484be0543e8f","cross_cats_sorted":["cs.HC","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-05T19:00:11Z","title_canon_sha256":"cd1d3dcca3509e6d3f987440416f177ac8a2d178611f19b4fb15dce3c3cb3bd1"},"schema_version":"1.0","source":{"id":"1712.01856","kind":"arxiv","version":2}},"canonical_sha256":"123f0e805ba197bf7c1c2cbcc272a4cbb64781cfdd6e2bb0ccbc0b32f3e62dfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"123f0e805ba197bf7c1c2cbcc272a4cbb64781cfdd6e2bb0ccbc0b32f3e62dfb","first_computed_at":"2026-05-18T00:21:34.453288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:34.453288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uu02n5TB1RO0wEwFATodkpg9F5qNKz9XUAsCLuF8sjk4N550UTtzkTL5u51pZCBQGy9U/wDZqn5D13F3mGtXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:34.453932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01856","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a933c9c4810d37466fb1519349a02bec0c1452bcd2a844be52b79d2dba7e03f","sha256:4f94949df46f817d534734158a316d684c7d81580959b3f0e781fac207815893"],"state_sha256":"bdc860522efb48435935cb8b7169929bc9863753400cdf3720edfb960eb1dac5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pwQ7dKNZaD3C9JTNzGU041wthRQhh6fbUqgOSN9fZfJtdJW1htdFRc1fTl2WsAcBAq5OjqkF50heFY1SJe7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:11:05.472243Z","bundle_sha256":"755f36425c1bcfef3a6a5bf1871a4930185b530c8876d5db8d66a1b5e0ea949d"}}