{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S5PXP2ADP3R7OSUKITGPE7ZI6O","short_pith_number":"pith:S5PXP2AD","canonical_record":{"source":{"id":"1809.09266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-25T00:20:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8cc9f34ada7032a04f6507b285107cd96a40b74280a8790961033aa0ee7f6cc9","abstract_canon_sha256":"280834f388e3b9efb6ce3e6e99c76fa7d2334bb6569d4e9a84ee0644dd7f1842"},"schema_version":"1.0"},"canonical_sha256":"975f77e8037ee3f74a8a44ccf27f28f3b5c4d1e861c95b28efbc7ceff7050454","source":{"kind":"arxiv","id":"1809.09266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09266","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09266v1","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09266","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"S5PXP2ADP3R7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5PXP2ADP3R7OSUK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5PXP2AD","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S5PXP2ADP3R7OSUKITGPE7ZI6O","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-25T00:20:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8cc9f34ada7032a04f6507b285107cd96a40b74280a8790961033aa0ee7f6cc9","abstract_canon_sha256":"280834f388e3b9efb6ce3e6e99c76fa7d2334bb6569d4e9a84ee0644dd7f1842"},"schema_version":"1.0"},"canonical_sha256":"975f77e8037ee3f74a8a44ccf27f28f3b5c4d1e861c95b28efbc7ceff7050454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:53.900744Z","signature_b64":"hxKJgAhrnjCy4tFZSO0ZmDoAq5E7gz1loahDzRVCKzUwq5I3rwh8v5/BPY+ipm2QPoEf+Iz2HqrvAFi6c+IuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975f77e8037ee3f74a8a44ccf27f28f3b5c4d1e861c95b28efbc7ceff7050454","last_reissued_at":"2026-05-18T00:04:53.900045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:53.900045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09266","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-18T00:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LX+D3oEX+xydglfjI2U4ygqNfbhwEdlLFg4kZWnC4iPASZK30QjvQ8OQXERBYH9DL5LwO4GiVpi26R+hC/c6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:44.163913Z"},"content_sha256":"8ace9230fae0851b3680f1d36c2a44ab98d0641bbbe68cf5a6d695b73e7b236e","schema_version":"1.0","event_id":"sha256:8ace9230fae0851b3680f1d36c2a44ab98d0641bbbe68cf5a6d695b73e7b236e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S5PXP2ADP3R7OSUKITGPE7ZI6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph filtering for data reduction and reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ioannis D. Schizas","submitted_at":"2018-09-25T00:20:40Z","abstract_excerpt":"A novel approach is put forth that utilizes data similarity, quantified on a graph, to improve upon the reconstruction performance of principal component analysis. The tasks of data dimensionality reduction and reconstruction are formulated as graph filtering operations, that enable the exploitation of data node connectivity in a graph via the adjacency matrix. The unknown reducing and reconstruction filters are determined by optimizing a mean-square error cost that entails the data, as well as their graph adjacency matrix. Working in the graph spectral domain enables the derivation of simple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09266","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-18T00:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USvdnkf2GAICZk6x+l1FQ9NmlHH2Y2quD8yXL2e/bwuf6l2D6mDg8+oqKNDiJjdziEOdqLSZxXNj831xMqvmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:07:44.164282Z"},"content_sha256":"37d082738250a2187c9454edc5e7a624f70017363bf0c420382a2a7a78cd7f58","schema_version":"1.0","event_id":"sha256:37d082738250a2187c9454edc5e7a624f70017363bf0c420382a2a7a78cd7f58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O/bundle.json","state_url":"https://pith.science/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O/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-06-03T16:07:44Z","links":{"resolver":"https://pith.science/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O","bundle":"https://pith.science/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O/bundle.json","state":"https://pith.science/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5PXP2ADP3R7OSUKITGPE7ZI6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S5PXP2ADP3R7OSUKITGPE7ZI6O","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":"280834f388e3b9efb6ce3e6e99c76fa7d2334bb6569d4e9a84ee0644dd7f1842","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-25T00:20:40Z","title_canon_sha256":"8cc9f34ada7032a04f6507b285107cd96a40b74280a8790961033aa0ee7f6cc9"},"schema_version":"1.0","source":{"id":"1809.09266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09266","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09266v1","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09266","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"S5PXP2ADP3R7","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S5PXP2ADP3R7OSUK","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S5PXP2AD","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:37d082738250a2187c9454edc5e7a624f70017363bf0c420382a2a7a78cd7f58","target":"graph","created_at":"2026-05-18T00:04:53Z","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":"A novel approach is put forth that utilizes data similarity, quantified on a graph, to improve upon the reconstruction performance of principal component analysis. The tasks of data dimensionality reduction and reconstruction are formulated as graph filtering operations, that enable the exploitation of data node connectivity in a graph via the adjacency matrix. The unknown reducing and reconstruction filters are determined by optimizing a mean-square error cost that entails the data, as well as their graph adjacency matrix. Working in the graph spectral domain enables the derivation of simple ","authors_text":"Ioannis D. Schizas","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-25T00:20:40Z","title":"Graph filtering for data reduction and reconstruction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09266","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:8ace9230fae0851b3680f1d36c2a44ab98d0641bbbe68cf5a6d695b73e7b236e","target":"record","created_at":"2026-05-18T00:04:53Z","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":"280834f388e3b9efb6ce3e6e99c76fa7d2334bb6569d4e9a84ee0644dd7f1842","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-25T00:20:40Z","title_canon_sha256":"8cc9f34ada7032a04f6507b285107cd96a40b74280a8790961033aa0ee7f6cc9"},"schema_version":"1.0","source":{"id":"1809.09266","kind":"arxiv","version":1}},"canonical_sha256":"975f77e8037ee3f74a8a44ccf27f28f3b5c4d1e861c95b28efbc7ceff7050454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"975f77e8037ee3f74a8a44ccf27f28f3b5c4d1e861c95b28efbc7ceff7050454","first_computed_at":"2026-05-18T00:04:53.900045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:53.900045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hxKJgAhrnjCy4tFZSO0ZmDoAq5E7gz1loahDzRVCKzUwq5I3rwh8v5/BPY+ipm2QPoEf+Iz2HqrvAFi6c+IuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:53.900744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ace9230fae0851b3680f1d36c2a44ab98d0641bbbe68cf5a6d695b73e7b236e","sha256:37d082738250a2187c9454edc5e7a624f70017363bf0c420382a2a7a78cd7f58"],"state_sha256":"10678d6cf29395f537260f0c1c9cf6b59da41be5a15b41cc3ff27d4108652882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDMDnW/Q5ckCDskCpCGCRFIsQ5HUH5HJb72zkRawIquKULGgYzKp41dAkTZeYodnphRqy34h/IeNDoxUitV1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:07:44.166179Z","bundle_sha256":"52aa10e76848f61f02b0c9efe842ea28e60a4d9878dcd88e82798e8e7c140204"}}