{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GG7KTTDJQM6ZPBYDKOF5T54R2O","short_pith_number":"pith:GG7KTTDJ","schema_version":"1.0","canonical_sha256":"31bea9cc69833d978703538bd9f791d3bb4e365b4cc4b8d8c39c64e490de1c5e","source":{"kind":"arxiv","id":"2608.08740","version":1},"attestation_state":"computed","paper":{"title":"Memory-Efficient Activation Checkpointing with Sliding Window and Hirschberg's Algorithm for 0/1 Knapsack Solving in PyTorch","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"J\\k{e}drzej Maczan","submitted_at":"2026-08-09T14:36:19Z","abstract_excerpt":"Activation checkpointing minimizes the runtime of neural networks under a given memory budget, by selecting which intermediate tensors to store and which to recompute. PyTorch solves this as a 0/1 knapsack problem, where operations from a joint forward-backward computation graph are items with a memory cost (weight) and a runtime saving (value). The default solver, dp_knapsack, allocates a full dynamic programming (DP) table of shape $(n+1) \\times (W+1)$, where $n$ is the number of operations and $W$ is the quantized memory budget. This method is resource-hungry and crashes at $n = 100$ items "},"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":"2608.08740","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-09T14:36:19Z","cross_cats_sorted":[],"title_canon_sha256":"6d75247d7858f61b98b6166f9d7aa55fc0b5f6fdec20a708739375672f0c88e1","abstract_canon_sha256":"f9abd654b86f9f4ab436166f1b7f3449ee83ff7fe1c6af2dab97d98a4cbe8288"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:25:11.777226Z","signature_b64":"kndimFjE6lynu1sS49wtlB0+U1mak45FKqwLmVXBOgZxC7EL6rU63TD3avTvVfJwsPkJT7F3e+QMZLLbaEf1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31bea9cc69833d978703538bd9f791d3bb4e365b4cc4b8d8c39c64e490de1c5e","last_reissued_at":"2026-08-11T01:25:11.774761Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:25:11.774761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Efficient Activation Checkpointing with Sliding Window and Hirschberg's Algorithm for 0/1 Knapsack Solving in PyTorch","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"J\\k{e}drzej Maczan","submitted_at":"2026-08-09T14:36:19Z","abstract_excerpt":"Activation checkpointing minimizes the runtime of neural networks under a given memory budget, by selecting which intermediate tensors to store and which to recompute. PyTorch solves this as a 0/1 knapsack problem, where operations from a joint forward-backward computation graph are items with a memory cost (weight) and a runtime saving (value). The default solver, dp_knapsack, allocates a full dynamic programming (DP) table of shape $(n+1) \\times (W+1)$, where $n$ is the number of operations and $W$ is the quantized memory budget. This method is resource-hungry and crashes at $n = 100$ items "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08740","kind":"arxiv","version":1},"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/2608.08740/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2608.08740","created_at":"2026-08-11T01:25:11.775549+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.08740v1","created_at":"2026-08-11T01:25:11.775549+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08740","created_at":"2026-08-11T01:25:11.775549+00:00"},{"alias_kind":"pith_short_12","alias_value":"GG7KTTDJQM6Z","created_at":"2026-08-11T01:25:11.775549+00:00"},{"alias_kind":"pith_short_16","alias_value":"GG7KTTDJQM6ZPBYD","created_at":"2026-08-11T01:25:11.775549+00:00"},{"alias_kind":"pith_short_8","alias_value":"GG7KTTDJ","created_at":"2026-08-11T01:25:11.775549+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/GG7KTTDJQM6ZPBYDKOF5T54R2O","json":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O.json","graph_json":"https://pith.science/api/pith-number/GG7KTTDJQM6ZPBYDKOF5T54R2O/graph.json","events_json":"https://pith.science/api/pith-number/GG7KTTDJQM6ZPBYDKOF5T54R2O/events.json","paper":"https://pith.science/paper/GG7KTTDJ"},"agent_actions":{"view_html":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O","download_json":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O.json","view_paper":"https://pith.science/paper/GG7KTTDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.08740&json=true","fetch_graph":"https://pith.science/api/pith-number/GG7KTTDJQM6ZPBYDKOF5T54R2O/graph.json","fetch_events":"https://pith.science/api/pith-number/GG7KTTDJQM6ZPBYDKOF5T54R2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O/action/storage_attestation","attest_author":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O/action/author_attestation","sign_citation":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O/action/citation_signature","submit_replication":"https://pith.science/pith/GG7KTTDJQM6ZPBYDKOF5T54R2O/action/replication_record"}},"created_at":"2026-08-11T01:25:11.775549+00:00","updated_at":"2026-08-11T01:25:11.775549+00:00"}