{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RNS2BLR4APAJQW5HZ7UQA3STKJ","short_pith_number":"pith:RNS2BLR4","canonical_record":{"source":{"id":"1211.3869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T12:00:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ecf1340ea40b237f685e2c8ea46cb50c0248d49c7b5235f7e4b32520e5e2f67","abstract_canon_sha256":"26102a09e5417ed89d965c04febcff4ba9bb53bb37d50fb83dcc896de0a9ac52"},"schema_version":"1.0"},"canonical_sha256":"8b65a0ae3c03c0985ba7cfe9006e53524948cd3dad6cd701580485a5fbb5f0b0","source":{"kind":"arxiv","id":"1211.3869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3869","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3869v1","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3869","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"RNS2BLR4APAJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RNS2BLR4APAJQW5H","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RNS2BLR4","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RNS2BLR4APAJQW5HZ7UQA3STKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T12:00:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8ecf1340ea40b237f685e2c8ea46cb50c0248d49c7b5235f7e4b32520e5e2f67","abstract_canon_sha256":"26102a09e5417ed89d965c04febcff4ba9bb53bb37d50fb83dcc896de0a9ac52"},"schema_version":"1.0"},"canonical_sha256":"8b65a0ae3c03c0985ba7cfe9006e53524948cd3dad6cd701580485a5fbb5f0b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.896795Z","signature_b64":"lIAoU1gQhqAFl5dj68TfCqSQaKEjfK3F7WWwLun/UMrTQjS67FkY8P6JKYcWbWE/DpyG8IdsrWMQ3X271POFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b65a0ae3c03c0985ba7cfe9006e53524948cd3dad6cd701580485a5fbb5f0b0","last_reissued_at":"2026-05-18T01:04:50.896268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.896268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3869","source_version":1,"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-05-18T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiOZJFqi0miepetXCHMjnQMskK9MB/3LOVQIr9dAKgsMNPiorjLUhGlN8vNC1GvRVlIAvEtxR0j55utSvsSjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:31:46.244701Z"},"content_sha256":"9927d66eb302ac02d085c10ac12d1e9029b24d645e4449d7e5053eb729db5729","schema_version":"1.0","event_id":"sha256:9927d66eb302ac02d085c10ac12d1e9029b24d645e4449d7e5053eb729db5729"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RNS2BLR4APAJQW5HZ7UQA3STKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transform coder identification based on quantization footprints and lattice theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marco Tagliasacchi, Marco Visentini-Scarzanella, Pier Luigi Dragotti, Stefano Tubaro","submitted_at":"2012-11-16T12:00:26Z","abstract_excerpt":"Transform coding is routinely used for lossy compression of discrete sources with memory. The input signal is divided into N-dimensional vectors, which are transformed by means of a linear mapping. Then, transform coefficients are quantized and entropy coded. In this paper we consider the problem of identifying the transform matrix as well as the quantization step sizes. We study the challenging case in which the only available information is a set of P transform decoded vectors. We formulate the problem in terms of finding the lattice with the largest determinant that contains all observed ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3869","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":""},"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-05-18T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v84zZBNLg0nfwjGy3hIoQ5dB5/qonEsvrerAlB5ys9q5o+O6U7KXxkhxJORXCZ3zosRr3FhdrXH/rnD/eKKMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:31:46.245056Z"},"content_sha256":"0e9a85bf5601d7cf2b38b57bd8ca578d4645b1103acbb8ffc8fd4cf4c3dc3ff7","schema_version":"1.0","event_id":"sha256:0e9a85bf5601d7cf2b38b57bd8ca578d4645b1103acbb8ffc8fd4cf4c3dc3ff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ/bundle.json","state_url":"https://pith.science/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ/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-05-28T10:31:46Z","links":{"resolver":"https://pith.science/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ","bundle":"https://pith.science/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ/bundle.json","state":"https://pith.science/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNS2BLR4APAJQW5HZ7UQA3STKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RNS2BLR4APAJQW5HZ7UQA3STKJ","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":"26102a09e5417ed89d965c04febcff4ba9bb53bb37d50fb83dcc896de0a9ac52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T12:00:26Z","title_canon_sha256":"8ecf1340ea40b237f685e2c8ea46cb50c0248d49c7b5235f7e4b32520e5e2f67"},"schema_version":"1.0","source":{"id":"1211.3869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3869","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3869v1","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3869","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"RNS2BLR4APAJ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RNS2BLR4APAJQW5H","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RNS2BLR4","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:0e9a85bf5601d7cf2b38b57bd8ca578d4645b1103acbb8ffc8fd4cf4c3dc3ff7","target":"graph","created_at":"2026-05-18T01:04:50Z","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"},"paper":{"abstract_excerpt":"Transform coding is routinely used for lossy compression of discrete sources with memory. The input signal is divided into N-dimensional vectors, which are transformed by means of a linear mapping. Then, transform coefficients are quantized and entropy coded. In this paper we consider the problem of identifying the transform matrix as well as the quantization step sizes. We study the challenging case in which the only available information is a set of P transform decoded vectors. We formulate the problem in terms of finding the lattice with the largest determinant that contains all observed ve","authors_text":"Marco Tagliasacchi, Marco Visentini-Scarzanella, Pier Luigi Dragotti, Stefano Tubaro","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T12:00:26Z","title":"Transform coder identification based on quantization footprints and lattice theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3869","kind":"arxiv","version":1},"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:9927d66eb302ac02d085c10ac12d1e9029b24d645e4449d7e5053eb729db5729","target":"record","created_at":"2026-05-18T01:04:50Z","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":"26102a09e5417ed89d965c04febcff4ba9bb53bb37d50fb83dcc896de0a9ac52","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-16T12:00:26Z","title_canon_sha256":"8ecf1340ea40b237f685e2c8ea46cb50c0248d49c7b5235f7e4b32520e5e2f67"},"schema_version":"1.0","source":{"id":"1211.3869","kind":"arxiv","version":1}},"canonical_sha256":"8b65a0ae3c03c0985ba7cfe9006e53524948cd3dad6cd701580485a5fbb5f0b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b65a0ae3c03c0985ba7cfe9006e53524948cd3dad6cd701580485a5fbb5f0b0","first_computed_at":"2026-05-18T01:04:50.896268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:50.896268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lIAoU1gQhqAFl5dj68TfCqSQaKEjfK3F7WWwLun/UMrTQjS67FkY8P6JKYcWbWE/DpyG8IdsrWMQ3X271POFBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:50.896795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9927d66eb302ac02d085c10ac12d1e9029b24d645e4449d7e5053eb729db5729","sha256:0e9a85bf5601d7cf2b38b57bd8ca578d4645b1103acbb8ffc8fd4cf4c3dc3ff7"],"state_sha256":"c84469cbacbeea5a809cc8d638cde61fee013e391f46588c7d5bffe142d75ad3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7lVuXdCCJYUItqNDRwnFuKqj8SSt1G1gQ8HZlKmppLmqVpoxijZOhRhVoEq1AGqmMP45P3lzv1VSdjeeInCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:31:46.246966Z","bundle_sha256":"0d7532cd121b792ce210a90d6a318020dec3c5d1fb3d6b8393bb2bc72ad95c57"}}