{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5LU7KAGTZJJZY2FYCYD6Y4PFH4","short_pith_number":"pith:5LU7KAGT","canonical_record":{"source":{"id":"1405.6231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-23T21:04:30Z","cross_cats_sorted":["math.SP","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"73b8bbee239dd038cdf1428beefcd37e8c0f461dc9db5ede76af9f4c06e6e9e1","abstract_canon_sha256":"f0dc02ef1910be13ef82b4cd3d2a4478b2c5296de95795961c486833d0a536d3"},"schema_version":"1.0"},"canonical_sha256":"eae9f500d3ca539c68b81607ec71e53f1fbd1922f720c6f4b3f66d4ccaafc073","source":{"kind":"arxiv","id":"1405.6231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6231","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6231v1","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6231","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"5LU7KAGTZJJZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LU7KAGTZJJZY2FY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LU7KAGT","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5LU7KAGTZJJZY2FYCYD6Y4PFH4","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-23T21:04:30Z","cross_cats_sorted":["math.SP","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"73b8bbee239dd038cdf1428beefcd37e8c0f461dc9db5ede76af9f4c06e6e9e1","abstract_canon_sha256":"f0dc02ef1910be13ef82b4cd3d2a4478b2c5296de95795961c486833d0a536d3"},"schema_version":"1.0"},"canonical_sha256":"eae9f500d3ca539c68b81607ec71e53f1fbd1922f720c6f4b3f66d4ccaafc073","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:07.710110Z","signature_b64":"vVh0pIHQPWrVMCffQl/s22WFlsYHkblVsIAYlKKuZ8jPaJOb9h+2OwbN0+FjAJr01F+FQZrBduwk7ZQUESwVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae9f500d3ca539c68b81607ec71e53f1fbd1922f720c6f4b3f66d4ccaafc073","last_reissued_at":"2026-05-18T02:51:07.709585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:07.709585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6231","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-18T02:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5NcNhOGB2j0MK/9f12TK9LW1BhP3KIz6zEJuacBu42RzHr+75CJsVL4q+gNgQodmM8UZhH4LRtm6K7kgBxACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:43:53.557936Z"},"content_sha256":"da1576341d944284d95138a1a9a5ca8c232f61b262ee87862b3de7fd464fb9f6","schema_version":"1.0","event_id":"sha256:da1576341d944284d95138a1a9a5ca8c232f61b262ee87862b3de7fd464fb9f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5LU7KAGTZJJZY2FYCYD6Y4PFH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connection graph Laplacian methods can be made robust to noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Hau-Tieng Wu, Noureddine El Karoui","submitted_at":"2014-05-23T21:04:30Z","abstract_excerpt":"Recently, several data analytic techniques based on connection graph laplacian (CGL) ideas have appeared in the literature. At this point, the properties of these methods are starting to be understood in the setting where the data is observed without noise. We study the impact of additive noise on these methods, and show that they are remarkably robust. As a by-product of our analysis, we propose modifications of the standard algorithms that increase their robustness to noise. We illustrate our results in numerical simulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6231","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-18T02:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdiDpMPustjYysbbfy4RAYIxq4FmfepiNrRUXY1vcKJm6AS0V9VEDhs+EQhOvKTYrimSfCmgL7GDsqpYutb7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:43:53.558532Z"},"content_sha256":"87790f849d4d03e5d3f0e88ea9c721684de3a51125b228af0041eded214d3bc1","schema_version":"1.0","event_id":"sha256:87790f849d4d03e5d3f0e88ea9c721684de3a51125b228af0041eded214d3bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4/bundle.json","state_url":"https://pith.science/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4/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-04T08:43:53Z","links":{"resolver":"https://pith.science/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4","bundle":"https://pith.science/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4/bundle.json","state":"https://pith.science/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LU7KAGTZJJZY2FYCYD6Y4PFH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5LU7KAGTZJJZY2FYCYD6Y4PFH4","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":"f0dc02ef1910be13ef82b4cd3d2a4478b2c5296de95795961c486833d0a536d3","cross_cats_sorted":["math.SP","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-23T21:04:30Z","title_canon_sha256":"73b8bbee239dd038cdf1428beefcd37e8c0f461dc9db5ede76af9f4c06e6e9e1"},"schema_version":"1.0","source":{"id":"1405.6231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6231","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6231v1","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6231","created_at":"2026-05-18T02:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"5LU7KAGTZJJZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LU7KAGTZJJZY2FY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LU7KAGT","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:87790f849d4d03e5d3f0e88ea9c721684de3a51125b228af0041eded214d3bc1","target":"graph","created_at":"2026-05-18T02:51:07Z","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":"Recently, several data analytic techniques based on connection graph laplacian (CGL) ideas have appeared in the literature. At this point, the properties of these methods are starting to be understood in the setting where the data is observed without noise. We study the impact of additive noise on these methods, and show that they are remarkably robust. As a by-product of our analysis, we propose modifications of the standard algorithms that increase their robustness to noise. We illustrate our results in numerical simulations.","authors_text":"Hau-Tieng Wu, Noureddine El Karoui","cross_cats":["math.SP","stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-23T21:04:30Z","title":"Connection graph Laplacian methods can be made robust to noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6231","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:da1576341d944284d95138a1a9a5ca8c232f61b262ee87862b3de7fd464fb9f6","target":"record","created_at":"2026-05-18T02:51:07Z","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":"f0dc02ef1910be13ef82b4cd3d2a4478b2c5296de95795961c486833d0a536d3","cross_cats_sorted":["math.SP","stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-23T21:04:30Z","title_canon_sha256":"73b8bbee239dd038cdf1428beefcd37e8c0f461dc9db5ede76af9f4c06e6e9e1"},"schema_version":"1.0","source":{"id":"1405.6231","kind":"arxiv","version":1}},"canonical_sha256":"eae9f500d3ca539c68b81607ec71e53f1fbd1922f720c6f4b3f66d4ccaafc073","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eae9f500d3ca539c68b81607ec71e53f1fbd1922f720c6f4b3f66d4ccaafc073","first_computed_at":"2026-05-18T02:51:07.709585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:07.709585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vVh0pIHQPWrVMCffQl/s22WFlsYHkblVsIAYlKKuZ8jPaJOb9h+2OwbN0+FjAJr01F+FQZrBduwk7ZQUESwVAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:07.710110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da1576341d944284d95138a1a9a5ca8c232f61b262ee87862b3de7fd464fb9f6","sha256:87790f849d4d03e5d3f0e88ea9c721684de3a51125b228af0041eded214d3bc1"],"state_sha256":"2d27a959745ef8f0392c3d59a8c7c68ef543c6ce766243857d08d173cee9316b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sygeBwZo8iqquTnrTWWnwt5HjSdJ9BxUPBFUxEs9scG6Bat4cCNG5j8FntBmFy4kIpR6dcs1gvSj74hR/ahDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:43:53.562399Z","bundle_sha256":"28d604c818c4b1e9c433cffa3c2e6d4082ff9e5d52baec89cc0dbf338eebbf6a"}}