{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EOHYVNWO726P6KGCIXDF75NHV3","short_pith_number":"pith:EOHYVNWO","schema_version":"1.0","canonical_sha256":"238f8ab6cefebcff28c245c65ff5a7aeef279805746999caa7282b6159751c25","source":{"kind":"arxiv","id":"2606.28251","version":1},"attestation_state":"computed","paper":{"title":"Push Puppet Networks: Structured Bayesian Pruning Algorithm for Language Model Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Robert Kubinec","submitted_at":"2026-06-26T16:37:06Z","abstract_excerpt":"This paper presents push puppet networks, a novel Bayesian algorithm for structured pruning of large language models. The push puppet network learns a hierarchical function during training that can optimally determine specific network layers to keep for a given target size. By adding a small number of gating parameters via a hierarchical penalty function, the learned smooth function can allow for a network to be resized to very specific sizes without loading the full model into memory or requiring further post-training computation. The method compares favorably with existing approaches (Sparse"},"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":"2606.28251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2026-06-26T16:37:06Z","cross_cats_sorted":[],"title_canon_sha256":"4dae20c65669ac8ed972598d4e18814eabd62af8b6d62892d88371a214cc3f91","abstract_canon_sha256":"8313aa6444f9d60ae21170ec38a9babd73e6778903a55b9a7d680ec878cfc83b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:15:10.420649Z","signature_b64":"mFpMi34fYLbnGE4mlEnlpZHN0jRVtpcnVx/T5y/fQJ3nXmbYetGRePdtd6u3DHk5UqK/chcTE64L6RWyC3tpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"238f8ab6cefebcff28c245c65ff5a7aeef279805746999caa7282b6159751c25","last_reissued_at":"2026-06-29T01:15:10.420266Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:15:10.420266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Push Puppet Networks: Structured Bayesian Pruning Algorithm for Language Model Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Robert Kubinec","submitted_at":"2026-06-26T16:37:06Z","abstract_excerpt":"This paper presents push puppet networks, a novel Bayesian algorithm for structured pruning of large language models. The push puppet network learns a hierarchical function during training that can optimally determine specific network layers to keep for a given target size. By adding a small number of gating parameters via a hierarchical penalty function, the learned smooth function can allow for a network to be resized to very specific sizes without loading the full model into memory or requiring further post-training computation. The method compares favorably with existing approaches (Sparse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28251","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/2606.28251/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":"2606.28251","created_at":"2026-06-29T01:15:10.420319+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28251v1","created_at":"2026-06-29T01:15:10.420319+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28251","created_at":"2026-06-29T01:15:10.420319+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOHYVNWO726P","created_at":"2026-06-29T01:15:10.420319+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOHYVNWO726P6KGC","created_at":"2026-06-29T01:15:10.420319+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOHYVNWO","created_at":"2026-06-29T01:15:10.420319+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/EOHYVNWO726P6KGCIXDF75NHV3","json":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3.json","graph_json":"https://pith.science/api/pith-number/EOHYVNWO726P6KGCIXDF75NHV3/graph.json","events_json":"https://pith.science/api/pith-number/EOHYVNWO726P6KGCIXDF75NHV3/events.json","paper":"https://pith.science/paper/EOHYVNWO"},"agent_actions":{"view_html":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3","download_json":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3.json","view_paper":"https://pith.science/paper/EOHYVNWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28251&json=true","fetch_graph":"https://pith.science/api/pith-number/EOHYVNWO726P6KGCIXDF75NHV3/graph.json","fetch_events":"https://pith.science/api/pith-number/EOHYVNWO726P6KGCIXDF75NHV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3/action/storage_attestation","attest_author":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3/action/author_attestation","sign_citation":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3/action/citation_signature","submit_replication":"https://pith.science/pith/EOHYVNWO726P6KGCIXDF75NHV3/action/replication_record"}},"created_at":"2026-06-29T01:15:10.420319+00:00","updated_at":"2026-06-29T01:15:10.420319+00:00"}