{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:34DYJA6FTEYN3VIKMSSTW7W6SV","short_pith_number":"pith:34DYJA6F","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"},"canonical_sha256":"df078483c59930ddd50a64a53b7ede9552d1326391f9ec0415215d8254bcbb11","source":{"kind":"arxiv","id":"1712.06393","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06393","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06393v3","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06393","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"34DYJA6FTEYN","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"pith_short_16","alias_value":"34DYJA6FTEYN3VIK","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"pith_short_8","alias_value":"34DYJA6F","created_at":"2026-07-04T23:50:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:34DYJA6FTEYN3VIKMSSTW7W6SV","target":"record","payload":{"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"},"canonical_sha256":"df078483c59930ddd50a64a53b7ede9552d1326391f9ec0415215d8254bcbb11","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"},"source_kind":"arxiv","source_id":"1712.06393","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/btui6yzxO66ZZWup/Zqdt8K41URXo4Jr/xUv1v7S3/suq/3POxZEvfbIjr9SqcQcMYdqc1JJR4szJQfLrdeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T09:56:57.572305Z"},"content_sha256":"9a7b0065d6877de562b138de913e13f0785f10f13916b81c2e1589a5fd9d107c","schema_version":"1.0","event_id":"sha256:9a7b0065d6877de562b138de913e13f0785f10f13916b81c2e1589a5fd9d107c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:34DYJA6FTEYN3VIKMSSTW7W6SV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:50:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdX5M6kApQe1RW4TVtAV2ce7tsNiPdwOFzaNS/aRfiDBoyNsP0wvt6f5IJclprEpROTQQsZmwyNpBlc7oB9iAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-20T09:56:57.572698Z"},"content_sha256":"269e194c644e99c322701c966ddf0fd2282903a803363afff5152fff9421a788","schema_version":"1.0","event_id":"sha256:269e194c644e99c322701c966ddf0fd2282903a803363afff5152fff9421a788"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/bundle.json","state_url":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-20T09:56:57Z","links":{"resolver":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV","bundle":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/bundle.json","state":"https://pith.science/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34DYJA6FTEYN3VIKMSSTW7W6SV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:34DYJA6FTEYN3VIKMSSTW7W6SV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"403c447b774a70a93d792ed7097d8198ec11f2cfe8b434157e206040e71689ae","cross_cats_sorted":["eess.IV","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-18T13:38:24Z","title_canon_sha256":"5fa5879abdc0a69ee4eca7029ca97a875d2b7c07e0ff7d800a6ad0c3caca8e54"},"schema_version":"1.0","source":{"id":"1712.06393","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06393","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06393v3","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06393","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"pith_short_12","alias_value":"34DYJA6FTEYN","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"pith_short_16","alias_value":"34DYJA6FTEYN3VIK","created_at":"2026-07-04T23:50:10Z"},{"alias_kind":"pith_short_8","alias_value":"34DYJA6F","created_at":"2026-07-04T23:50:10Z"}],"graph_snapshots":[{"event_id":"sha256:269e194c644e99c322701c966ddf0fd2282903a803363afff5152fff9421a788","target":"graph","created_at":"2026-07-04T23:50:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1712.06393/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dorina Thanou, Giulia Fracastoro, Pascal Frossard","cross_cats":["eess.IV","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-18T13:38:24Z","title":"Graph Transform Optimization with Application to Image Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06393","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9a7b0065d6877de562b138de913e13f0785f10f13916b81c2e1589a5fd9d107c","target":"record","created_at":"2026-07-04T23:50:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"403c447b774a70a93d792ed7097d8198ec11f2cfe8b434157e206040e71689ae","cross_cats_sorted":["eess.IV","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-18T13:38:24Z","title_canon_sha256":"5fa5879abdc0a69ee4eca7029ca97a875d2b7c07e0ff7d800a6ad0c3caca8e54"},"schema_version":"1.0","source":{"id":"1712.06393","kind":"arxiv","version":3}},"canonical_sha256":"df078483c59930ddd50a64a53b7ede9552d1326391f9ec0415215d8254bcbb11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df078483c59930ddd50a64a53b7ede9552d1326391f9ec0415215d8254bcbb11","first_computed_at":"2026-07-04T23:50:10.976708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:50:10.976708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MC5R+OV1ENXcH/2+AGtYIU+nx0f7vEtXr0zSOOyw5BYjyH9p0ajpddCm7XrLHkMsffTxL4jKKgLTJuQ/x4NPCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:50:10.977224Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06393","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a7b0065d6877de562b138de913e13f0785f10f13916b81c2e1589a5fd9d107c","sha256:269e194c644e99c322701c966ddf0fd2282903a803363afff5152fff9421a788"],"state_sha256":"c77d5edf1e606dba5eecaa57b6761b233d47a39ebba5ad5c4fd556090638fda8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OM+pGGI62BH0cr5CKTXiKXdE91/KYGdUD18KH/jkuHA9aaT9AdH6uPRWcrHVseZyIGDYLOhy07KmclKaa9OQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-20T09:56:57.575257Z","bundle_sha256":"96750fb776f53307a76e2c750d5d35f930a82d339909400b6ed2110411c04c6e"}}