{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6546MYNJBK6T2UPYUY6LWXN4X3","short_pith_number":"pith:6546MYNJ","canonical_record":{"source":{"id":"1808.04768","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T16:07:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"278ed021e8465c41e99f1ab10343f72f44ba15d96b6d8982fec696c129112ec2","abstract_canon_sha256":"e3effcee78aa9f73e76e13e7fde5a5743f00057ed5f503aa79cc15c67026259b"},"schema_version":"1.0"},"canonical_sha256":"f779e661a90abd3d51f8a63cbb5dbcbefce29b0b1a92f6c00e88e1191beaddef","source":{"kind":"arxiv","id":"1808.04768","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04768","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04768v3","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04768","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"6546MYNJBK6T","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6546MYNJBK6T2UPY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6546MYNJ","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6546MYNJBK6T2UPYUY6LWXN4X3","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04768","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T16:07:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"278ed021e8465c41e99f1ab10343f72f44ba15d96b6d8982fec696c129112ec2","abstract_canon_sha256":"e3effcee78aa9f73e76e13e7fde5a5743f00057ed5f503aa79cc15c67026259b"},"schema_version":"1.0"},"canonical_sha256":"f779e661a90abd3d51f8a63cbb5dbcbefce29b0b1a92f6c00e88e1191beaddef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.844065Z","signature_b64":"pGsrMrgq2O63rphjTV+WFa2OfiJyLkqWlF88Z7nEsuZdVA7iL3sib0krHyLn9Y9BEOnY1UjlyeXgSfIG7JBwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f779e661a90abd3d51f8a63cbb5dbcbefce29b0b1a92f6c00e88e1191beaddef","last_reissued_at":"2026-05-17T23:58:24.843388Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.843388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04768","source_version":3,"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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPEmIeAi6FFSw8xhrRWs9r3euvMSPA48ILLWz2pz2GHTsorknedU9pmrNAQJsHGPlkHuyV+N0h+z37THun46CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:52:49.333386Z"},"content_sha256":"7a2305e98d6692e44f19ff2d8964bbee4cf2896839f5032e2cfae235be99ba17","schema_version":"1.0","event_id":"sha256:7a2305e98d6692e44f19ff2d8964bbee4cf2896839f5032e2cfae235be99ba17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6546MYNJBK6T2UPYUY6LWXN4X3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Skip Intervals: Temporal Abstraction for Recurrent Dynamical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Neitz, Bernhard Sch\\\"olkopf, Giambattista Parascandolo, Stefan Bauer","submitted_at":"2018-08-14T16:07:41Z","abstract_excerpt":"We introduce a method which enables a recurrent dynamics model to be temporally abstract. Our approach, which we call Adaptive Skip Intervals (ASI), is based on the observation that in many sequential prediction tasks, the exact time at which events occur is irrelevant to the underlying objective. Moreover, in many situations, there exist prediction intervals which result in particularly easy-to-predict transitions. We show that there are prediction tasks for which we gain both computational efficiency and prediction accuracy by allowing the model to make predictions at a sampling rate which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04768","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"},"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-17T23:58:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DeSjRbVtGGrVHgeuvwOLWX8QSyNt0aKYBCa0LUcHhm9s0KxRKhm0cUKCShu3omSljUHEwCN+8CigJpE1rRQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:52:49.333746Z"},"content_sha256":"e047336f82568bf78881a660d99e520950aa2fc2d89cbd733227adaa368d170d","schema_version":"1.0","event_id":"sha256:e047336f82568bf78881a660d99e520950aa2fc2d89cbd733227adaa368d170d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6546MYNJBK6T2UPYUY6LWXN4X3/bundle.json","state_url":"https://pith.science/pith/6546MYNJBK6T2UPYUY6LWXN4X3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6546MYNJBK6T2UPYUY6LWXN4X3/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-30T13:52:49Z","links":{"resolver":"https://pith.science/pith/6546MYNJBK6T2UPYUY6LWXN4X3","bundle":"https://pith.science/pith/6546MYNJBK6T2UPYUY6LWXN4X3/bundle.json","state":"https://pith.science/pith/6546MYNJBK6T2UPYUY6LWXN4X3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6546MYNJBK6T2UPYUY6LWXN4X3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6546MYNJBK6T2UPYUY6LWXN4X3","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":"e3effcee78aa9f73e76e13e7fde5a5743f00057ed5f503aa79cc15c67026259b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T16:07:41Z","title_canon_sha256":"278ed021e8465c41e99f1ab10343f72f44ba15d96b6d8982fec696c129112ec2"},"schema_version":"1.0","source":{"id":"1808.04768","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04768","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04768v3","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04768","created_at":"2026-05-17T23:58:24Z"},{"alias_kind":"pith_short_12","alias_value":"6546MYNJBK6T","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6546MYNJBK6T2UPY","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6546MYNJ","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:e047336f82568bf78881a660d99e520950aa2fc2d89cbd733227adaa368d170d","target":"graph","created_at":"2026-05-17T23:58:24Z","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 introduce a method which enables a recurrent dynamics model to be temporally abstract. Our approach, which we call Adaptive Skip Intervals (ASI), is based on the observation that in many sequential prediction tasks, the exact time at which events occur is irrelevant to the underlying objective. Moreover, in many situations, there exist prediction intervals which result in particularly easy-to-predict transitions. We show that there are prediction tasks for which we gain both computational efficiency and prediction accuracy by allowing the model to make predictions at a sampling rate which i","authors_text":"Alexander Neitz, Bernhard Sch\\\"olkopf, Giambattista Parascandolo, Stefan Bauer","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T16:07:41Z","title":"Adaptive Skip Intervals: Temporal Abstraction for Recurrent Dynamical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04768","kind":"arxiv","version":3},"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:7a2305e98d6692e44f19ff2d8964bbee4cf2896839f5032e2cfae235be99ba17","target":"record","created_at":"2026-05-17T23:58:24Z","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":"e3effcee78aa9f73e76e13e7fde5a5743f00057ed5f503aa79cc15c67026259b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-14T16:07:41Z","title_canon_sha256":"278ed021e8465c41e99f1ab10343f72f44ba15d96b6d8982fec696c129112ec2"},"schema_version":"1.0","source":{"id":"1808.04768","kind":"arxiv","version":3}},"canonical_sha256":"f779e661a90abd3d51f8a63cbb5dbcbefce29b0b1a92f6c00e88e1191beaddef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f779e661a90abd3d51f8a63cbb5dbcbefce29b0b1a92f6c00e88e1191beaddef","first_computed_at":"2026-05-17T23:58:24.843388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:24.843388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pGsrMrgq2O63rphjTV+WFa2OfiJyLkqWlF88Z7nEsuZdVA7iL3sib0krHyLn9Y9BEOnY1UjlyeXgSfIG7JBwDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:24.844065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04768","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a2305e98d6692e44f19ff2d8964bbee4cf2896839f5032e2cfae235be99ba17","sha256:e047336f82568bf78881a660d99e520950aa2fc2d89cbd733227adaa368d170d"],"state_sha256":"46d7f2f5b28da505ef955d3e3625f2baaced868a4c69c7aea81f26cc253f46dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u6SeSbTdEaRgWHeD3PwMBiFdevP4BGysFtLgAT6/Y5VjYZDNlBjZ2OV7VR+ka4yKh9Fqokyymx/IV+9XgZTWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:52:49.336005Z","bundle_sha256":"9c3fb4749af34bd92754d807a3d54f830b28e22931f3c13c5f06e4754fd1f5e1"}}