{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VO2D7SQX3FRK5A4TMQNVB7VXCL","short_pith_number":"pith:VO2D7SQX","canonical_record":{"source":{"id":"2010.14785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-28T06:33:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"70e92530108e6e49fb647f2359f88ebc099266fa961658686410e8bfd0cdf409","abstract_canon_sha256":"ef70b68cf85581fd2ea03a34f36eeaf7ffd9dac9ee0835617a5b4e97cb852f65"},"schema_version":"1.0"},"canonical_sha256":"abb43fca17d962ae8393641b50feb712f4f7cb534b529ec2e8ef3469a8b724b2","source":{"kind":"arxiv","id":"2010.14785","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.14785","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"2010.14785v2","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14785","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"VO2D7SQX3FRK","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"pith_short_16","alias_value":"VO2D7SQX3FRK5A4T","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"pith_short_8","alias_value":"VO2D7SQX","created_at":"2026-07-05T02:50:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VO2D7SQX3FRK5A4TMQNVB7VXCL","target":"record","payload":{"canonical_record":{"source":{"id":"2010.14785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-28T06:33:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"70e92530108e6e49fb647f2359f88ebc099266fa961658686410e8bfd0cdf409","abstract_canon_sha256":"ef70b68cf85581fd2ea03a34f36eeaf7ffd9dac9ee0835617a5b4e97cb852f65"},"schema_version":"1.0"},"canonical_sha256":"abb43fca17d962ae8393641b50feb712f4f7cb534b529ec2e8ef3469a8b724b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:50:41.631533Z","signature_b64":"jlzLK5LjP5NtAusnJ49IBW32wEMDt1QC47MqipHdmOUUBvxoOhiAZppGFTViObRyom0qL7k9cT5nqnHm5ZNFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb43fca17d962ae8393641b50feb712f4f7cb534b529ec2e8ef3469a8b724b2","last_reissued_at":"2026-07-05T02:50:41.631002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:50:41.631002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.14785","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-07-05T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPvfBAK1ioS34IEXqjJuHYHADxqOTG40NQ8BmYXA8RYMigzng+kWSd1I7m5oaQzcq5lwJO8rIngr2/6ffq1HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:05:57.277539Z"},"content_sha256":"bee1e2dc23a83356571b16db383bf673ce19527d667121c13c97b1edd324d903","schema_version":"1.0","event_id":"sha256:bee1e2dc23a83356571b16db383bf673ce19527d667121c13c97b1edd324d903"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VO2D7SQX3FRK5A4TMQNVB7VXCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing Interpretable Approximations to Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Krishna Chaitanya Kalagarla, Nathan Dahlin, Nikhil Naik, Pierluigi Nuzzo, Rahul Jain","submitted_at":"2020-10-28T06:33:09Z","abstract_excerpt":"In an ever expanding set of research and application areas, deep neural networks (DNNs) set the bar for algorithm performance. However, depending upon additional constraints such as processing power and execution time limits, or requirements such as verifiable safety guarantees, it may not be feasible to actually use such high-performing DNNs in practice. Many techniques have been developed in recent years to compress or distill complex DNNs into smaller, faster or more understandable models and controllers. This work seeks to identify reduced models that not only preserve a desired performanc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14785","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.14785/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2L02VJ9vl92V2LHPG+bNjmXhT1YN0MPeQtUVmCJxMtDAleQ/2NE2hnENjUuof1MNb7jFxtL+VM41WsRyAS7sAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:05:57.278506Z"},"content_sha256":"369b0a5b747263e57075e4557a1734985ffbf4a64c29892127c3edc96a32bf73","schema_version":"1.0","event_id":"sha256:369b0a5b747263e57075e4557a1734985ffbf4a64c29892127c3edc96a32bf73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL/bundle.json","state_url":"https://pith.science/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL/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-08-12T21:05:57Z","links":{"resolver":"https://pith.science/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL","bundle":"https://pith.science/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL/bundle.json","state":"https://pith.science/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VO2D7SQX3FRK5A4TMQNVB7VXCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VO2D7SQX3FRK5A4TMQNVB7VXCL","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":"ef70b68cf85581fd2ea03a34f36eeaf7ffd9dac9ee0835617a5b4e97cb852f65","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-28T06:33:09Z","title_canon_sha256":"70e92530108e6e49fb647f2359f88ebc099266fa961658686410e8bfd0cdf409"},"schema_version":"1.0","source":{"id":"2010.14785","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.14785","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"2010.14785v2","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.14785","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"VO2D7SQX3FRK","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"pith_short_16","alias_value":"VO2D7SQX3FRK5A4T","created_at":"2026-07-05T02:50:41Z"},{"alias_kind":"pith_short_8","alias_value":"VO2D7SQX","created_at":"2026-07-05T02:50:41Z"}],"graph_snapshots":[{"event_id":"sha256:369b0a5b747263e57075e4557a1734985ffbf4a64c29892127c3edc96a32bf73","target":"graph","created_at":"2026-07-05T02:50:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.14785/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In an ever expanding set of research and application areas, deep neural networks (DNNs) set the bar for algorithm performance. However, depending upon additional constraints such as processing power and execution time limits, or requirements such as verifiable safety guarantees, it may not be feasible to actually use such high-performing DNNs in practice. Many techniques have been developed in recent years to compress or distill complex DNNs into smaller, faster or more understandable models and controllers. This work seeks to identify reduced models that not only preserve a desired performanc","authors_text":"Krishna Chaitanya Kalagarla, Nathan Dahlin, Nikhil Naik, Pierluigi Nuzzo, Rahul Jain","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-28T06:33:09Z","title":"Designing Interpretable Approximations to Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.14785","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:bee1e2dc23a83356571b16db383bf673ce19527d667121c13c97b1edd324d903","target":"record","created_at":"2026-07-05T02:50:41Z","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":"ef70b68cf85581fd2ea03a34f36eeaf7ffd9dac9ee0835617a5b4e97cb852f65","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-28T06:33:09Z","title_canon_sha256":"70e92530108e6e49fb647f2359f88ebc099266fa961658686410e8bfd0cdf409"},"schema_version":"1.0","source":{"id":"2010.14785","kind":"arxiv","version":2}},"canonical_sha256":"abb43fca17d962ae8393641b50feb712f4f7cb534b529ec2e8ef3469a8b724b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abb43fca17d962ae8393641b50feb712f4f7cb534b529ec2e8ef3469a8b724b2","first_computed_at":"2026-07-05T02:50:41.631002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:50:41.631002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jlzLK5LjP5NtAusnJ49IBW32wEMDt1QC47MqipHdmOUUBvxoOhiAZppGFTViObRyom0qL7k9cT5nqnHm5ZNFAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:50:41.631533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.14785","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee1e2dc23a83356571b16db383bf673ce19527d667121c13c97b1edd324d903","sha256:369b0a5b747263e57075e4557a1734985ffbf4a64c29892127c3edc96a32bf73"],"state_sha256":"824dbba0d0bfec06fba0f83e0d12999bb0a3036210093a5c10d138c504c36fbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7P4DdluQZx7glSaRSbob048A6k7tCAa5diF9QuOE+rMY72AkiPPH9h3oe7o7F+Rd58mhzAG2Sax77aV3L6bXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:05:57.301959Z","bundle_sha256":"a975870e703a29ad0d57a793aa8f4cb182c2cd7402f736372afbeb59a7710203"}}