{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:34DYJA6FTEYN3VIKMSSTW7W6SV","short_pith_number":"pith:34DYJA6F","schema_version":"1.0","canonical_sha256":"df078483c59930ddd50a64a53b7ede9552d1326391f9ec0415215d8254bcbb11","source":{"kind":"arxiv","id":"1712.06393","version":3},"attestation_state":"computed","paper":{"title":"Graph Transform Optimization with Application to Image Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","math.IT"],"primary_cat":"cs.IT","authors_text":"Dorina Thanou, Giulia Fracastoro, Pascal Frossard","submitted_at":"2017-12-18T13:38:24Z","abstract_excerpt":"In this paper, we propose a new graph-based transform and illustrate its potential application to signal compression. Our approach relies on the careful design of a graph that optimizes the overall rate-distortion performance through an effective graph-based transform. We introduce a novel graph estimation algorithm, which uncovers the connectivities between the graph signal values by taking into consideration the coding of both the signal and the graph topology in rate-distortion terms. In particular, we introduce a novel coding solution for the graph by treating the edge weights as another g"},"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":"1712.06393","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-18T13:38:24Z","cross_cats_sorted":["eess.IV","math.IT"],"title_canon_sha256":"5fa5879abdc0a69ee4eca7029ca97a875d2b7c07e0ff7d800a6ad0c3caca8e54","abstract_canon_sha256":"403c447b774a70a93d792ed7097d8198ec11f2cfe8b434157e206040e71689ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:10.977224Z","signature_b64":"MC5R+OV1ENXcH/2+AGtYIU+nx0f7vEtXr0zSOOyw5BYjyH9p0ajpddCm7XrLHkMsffTxL4jKKgLTJuQ/x4NPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df078483c59930ddd50a64a53b7ede9552d1326391f9ec0415215d8254bcbb11","last_reissued_at":"2026-07-04T23:50:10.976708Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:10.976708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Transform Optimization with Application to Image Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV","math.IT"],"primary_cat":"cs.IT","authors_text":"Dorina Thanou, Giulia Fracastoro, Pascal Frossard","submitted_at":"2017-12-18T13:38:24Z","abstract_excerpt":"In this paper, we propose a new graph-based transform and illustrate its potential application to signal compression. Our approach relies on the careful design of a graph that optimizes the overall rate-distortion performance through an effective graph-based transform. We introduce a novel graph estimation algorithm, which uncovers the connectivities between the graph signal values by taking into consideration the coding of both the signal and the graph topology in rate-distortion terms. In particular, we introduce a novel coding solution for the graph by treating the edge weights as another g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06393","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1712.06393/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":"1712.06393","created_at":"2026-07-04T23:50:10.976767+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06393v3","created_at":"2026-07-04T23:50:10.976767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06393","created_at":"2026-07-04T23:50:10.976767+00:00"},{"alias_kind":"pith_short_12","alias_value":"34DYJA6FTEYN","created_at":"2026-07-04T23:50:10.976767+00:00"},{"alias_kind":"pith_short_16","alias_value":"34DYJA6FTEYN3VIK","created_at":"2026-07-04T23:50:10.976767+00:00"},{"alias_kind":"pith_short_8","alias_value":"34DYJA6F","created_at":"2026-07-04T23:50:10.976767+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/34DYJA6FTEYN3VIKMSSTW7W6SV","json":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV.json","graph_json":"https://pith.science/api/pith-number/34DYJA6FTEYN3VIKMSSTW7W6SV/graph.json","events_json":"https://pith.science/api/pith-number/34DYJA6FTEYN3VIKMSSTW7W6SV/events.json","paper":"https://pith.science/paper/34DYJA6F"},"agent_actions":{"view_html":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV","download_json":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV.json","view_paper":"https://pith.science/paper/34DYJA6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06393&json=true","fetch_graph":"https://pith.science/api/pith-number/34DYJA6FTEYN3VIKMSSTW7W6SV/graph.json","fetch_events":"https://pith.science/api/pith-number/34DYJA6FTEYN3VIKMSSTW7W6SV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/action/storage_attestation","attest_author":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/action/author_attestation","sign_citation":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/action/citation_signature","submit_replication":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/action/replication_record"}},"created_at":"2026-07-04T23:50:10.976767+00:00","updated_at":"2026-07-04T23:50:10.976767+00:00"}