{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IKRBVUB24NOBGZO424EP2QK62E","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":"d6d6a1cfbf6617cd52c13a96e336888f7686ea0fbe10d6462160fc85ceaeaf05","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T14:52:03Z","title_canon_sha256":"f3e5ed16d9a8bf8800cd4d697af45b0a739bdc61c8222dfa98ac318d179222c4"},"schema_version":"1.0","source":{"id":"1904.11875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11875","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11875v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11875","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"IKRBVUB24NOB","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IKRBVUB24NOBGZO4","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IKRBVUB2","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:8dd5efce100ffa9c4b76da6a7de60ecd52792b5ae76a33892fb95db649816e4c","target":"graph","created_at":"2026-05-17T23:47:40Z","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":"It is common to encounter situations where one must solve a sequence of similar computational problems. Running a standard algorithm with worst-case runtime guarantees on each instance will fail to take advantage of valuable structure shared across the problem instances. For example, when a commuter drives from work to home, there are typically only a handful of routes that will ever be the shortest path. A naive algorithm that does not exploit this common structure may spend most of its time checking roads that will never be in the shortest path. More generally, we can often ignore large swat","authors_text":"Adam Tauman Kalai, Cameron Musco, Christos Tzamos, Daniel Alabi, Ellen Vitercik, Katrina Ligett","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T14:52:03Z","title":"Learning to Prune: Speeding up Repeated Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11875","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:72cacbf16e97ea82605881cab37219d770c6e00a5c424e16975fde31b3b045e6","target":"record","created_at":"2026-05-17T23:47:40Z","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":"d6d6a1cfbf6617cd52c13a96e336888f7686ea0fbe10d6462160fc85ceaeaf05","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T14:52:03Z","title_canon_sha256":"f3e5ed16d9a8bf8800cd4d697af45b0a739bdc61c8222dfa98ac318d179222c4"},"schema_version":"1.0","source":{"id":"1904.11875","kind":"arxiv","version":1}},"canonical_sha256":"42a21ad03ae35c1365dcd708fd415ed1325e5325a19d80bee619a9de45f3e5e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42a21ad03ae35c1365dcd708fd415ed1325e5325a19d80bee619a9de45f3e5e4","first_computed_at":"2026-05-17T23:47:40.712942Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:40.712942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wjxb4HsurjH24MxV5St9KnZulPQlEsnV6bkYdqOiQES1n7knMUR6nWzfQhMFGdpTYhb7K1lurM710IcH4lDkDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:40.713381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72cacbf16e97ea82605881cab37219d770c6e00a5c424e16975fde31b3b045e6","sha256:8dd5efce100ffa9c4b76da6a7de60ecd52792b5ae76a33892fb95db649816e4c"],"state_sha256":"35414d63b7a6b1a230e2df5aceffa52c00ae60322507c623449659f5ca6eb285"}