{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EL6RNSIFM3BECRVVEHRGEEUC7L","short_pith_number":"pith:EL6RNSIF","schema_version":"1.0","canonical_sha256":"22fd16c90566c24146b521e2621282fad2e4ea7313312625a2fac2c516a79401","source":{"kind":"arxiv","id":"2607.21366","version":1},"attestation_state":"computed","paper":{"title":"Hilbert Operator for Progressive Encoding (HOPE): A Mathematical Framework for Deconstructing Learned Representations in Deep Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hossein Mobahi, Peter L. Bartlett","submitted_at":"2026-07-23T14:31:16Z","abstract_excerpt":"Deep neural networks encode complex representations, but deconstructing this internal knowledge remains a challenge. Given the link between learning and compression, network compression offers a promising lens to analyze this knowledge. However, standard compression heuristics often suffer from scale symmetries and architectural biases. To resolve these, we introduce Hilbert Operator for Progressive Encoding (HOPE), a mathematical framework to gradually deconstruct the representations in trained network weights.\n  HOPE shifts network compression from the discrete domain into a Hilbert space of"},"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":"2607.21366","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-23T14:31:16Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"fd7e8b7a30e621a5cd6cbe99919c964ef203df13f1b09f51df6c9c3778efc3c3","abstract_canon_sha256":"f9c75ff2764fccb66ee6757e9c40e5e06da8683cdfff3b2691af0db29d26f43f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-24T01:24:28.695372Z","signature_b64":"+EwjJ1wbB4wIvdqtyKK/TBdlKSR6f8aYAfcpJtjKZOSiUH7515aAvYooxsrBH1wVtokdwSpsfztQ0VoabD2hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22fd16c90566c24146b521e2621282fad2e4ea7313312625a2fac2c516a79401","last_reissued_at":"2026-07-24T01:24:28.694478Z","signature_status":"signed_v1","first_computed_at":"2026-07-24T01:24:28.694478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hilbert Operator for Progressive Encoding (HOPE): A Mathematical Framework for Deconstructing Learned Representations in Deep Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hossein Mobahi, Peter L. Bartlett","submitted_at":"2026-07-23T14:31:16Z","abstract_excerpt":"Deep neural networks encode complex representations, but deconstructing this internal knowledge remains a challenge. Given the link between learning and compression, network compression offers a promising lens to analyze this knowledge. However, standard compression heuristics often suffer from scale symmetries and architectural biases. To resolve these, we introduce Hilbert Operator for Progressive Encoding (HOPE), a mathematical framework to gradually deconstruct the representations in trained network weights.\n  HOPE shifts network compression from the discrete domain into a Hilbert space of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21366","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/2607.21366/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":"2607.21366","created_at":"2026-07-24T01:24:28.694940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.21366v1","created_at":"2026-07-24T01:24:28.694940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21366","created_at":"2026-07-24T01:24:28.694940+00:00"},{"alias_kind":"pith_short_12","alias_value":"EL6RNSIFM3BE","created_at":"2026-07-24T01:24:28.694940+00:00"},{"alias_kind":"pith_short_16","alias_value":"EL6RNSIFM3BECRVV","created_at":"2026-07-24T01:24:28.694940+00:00"},{"alias_kind":"pith_short_8","alias_value":"EL6RNSIF","created_at":"2026-07-24T01:24:28.694940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.02940","citing_title":"When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L","json":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L.json","graph_json":"https://pith.science/api/pith-number/EL6RNSIFM3BECRVVEHRGEEUC7L/graph.json","events_json":"https://pith.science/api/pith-number/EL6RNSIFM3BECRVVEHRGEEUC7L/events.json","paper":"https://pith.science/paper/EL6RNSIF"},"agent_actions":{"view_html":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L","download_json":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L.json","view_paper":"https://pith.science/paper/EL6RNSIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.21366&json=true","fetch_graph":"https://pith.science/api/pith-number/EL6RNSIFM3BECRVVEHRGEEUC7L/graph.json","fetch_events":"https://pith.science/api/pith-number/EL6RNSIFM3BECRVVEHRGEEUC7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L/action/storage_attestation","attest_author":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L/action/author_attestation","sign_citation":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L/action/citation_signature","submit_replication":"https://pith.science/pith/EL6RNSIFM3BECRVVEHRGEEUC7L/action/replication_record"}},"created_at":"2026-07-24T01:24:28.694940+00:00","updated_at":"2026-07-24T01:24:28.694940+00:00"}