{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:OFOJJHFKHCDOGFMHXZJQ7TWRUQ","short_pith_number":"pith:OFOJJHFK","schema_version":"1.0","canonical_sha256":"715c949caa3886e31587be530fced1a41685060dee9013116f4b11b895e035e4","source":{"kind":"arxiv","id":"0909.1599","version":3},"attestation_state":"computed","paper":{"title":"Frame Permutation Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ha Q. Nguyen, Lav R. Varshney, Vivek K Goyal","submitted_at":"2009-09-09T01:01:52Z","abstract_excerpt":"Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its frame expansion. This means that the encoding is a partial ordering of the frame expansion coefficients. Compared to ordinary permutation source coding, FPQ produces a greater number of possible quantization rates and a higher maximum rate. Various representations for the partitions induced by FPQ are presented, and reconstruction algorithms based on linear programming, quadratic programming, and recursive orthogonal projec"},"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":"0909.1599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-09-09T01:01:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"549dc85b5581dd1cc1e4057694882f7d3058181afeaa53e42d2ebfc9d9102a67","abstract_canon_sha256":"d67395de3ba72fedbe5f6cbe314d139d5bd46fc03ad1222f04121b32620efdb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:48.241703Z","signature_b64":"5fTzaSrp3SUSacl2PSI5yFy5ANMNikaFCWu4A79IB2nEk3G79u6Nz/yUF5SATj7jJnHj52omSD3h8NvFbRdNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715c949caa3886e31587be530fced1a41685060dee9013116f4b11b895e035e4","last_reissued_at":"2026-05-18T02:20:48.241004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:48.241004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frame Permutation Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ha Q. Nguyen, Lav R. Varshney, Vivek K Goyal","submitted_at":"2009-09-09T01:01:52Z","abstract_excerpt":"Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its frame expansion. This means that the encoding is a partial ordering of the frame expansion coefficients. Compared to ordinary permutation source coding, FPQ produces a greater number of possible quantization rates and a higher maximum rate. Various representations for the partitions induced by FPQ are presented, and reconstruction algorithms based on linear programming, quadratic programming, and recursive orthogonal projec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1599","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"0909.1599","created_at":"2026-05-18T02:20:48.241117+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.1599v3","created_at":"2026-05-18T02:20:48.241117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1599","created_at":"2026-05-18T02:20:48.241117+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFOJJHFKHCDO","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFOJJHFKHCDOGFMH","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFOJJHFK","created_at":"2026-05-18T12:26:01.383474+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/OFOJJHFKHCDOGFMHXZJQ7TWRUQ","json":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ.json","graph_json":"https://pith.science/api/pith-number/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/graph.json","events_json":"https://pith.science/api/pith-number/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/events.json","paper":"https://pith.science/paper/OFOJJHFK"},"agent_actions":{"view_html":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ","download_json":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ.json","view_paper":"https://pith.science/paper/OFOJJHFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.1599&json=true","fetch_graph":"https://pith.science/api/pith-number/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/action/storage_attestation","attest_author":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/action/author_attestation","sign_citation":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/action/citation_signature","submit_replication":"https://pith.science/pith/OFOJJHFKHCDOGFMHXZJQ7TWRUQ/action/replication_record"}},"created_at":"2026-05-18T02:20:48.241117+00:00","updated_at":"2026-05-18T02:20:48.241117+00:00"}