{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WM2ZUFB5FLOFQFTZMRQIYXHWCW","short_pith_number":"pith:WM2ZUFB5","canonical_record":{"source":{"id":"1506.02344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-08T03:37:36Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"24020eb1917d3c5f4086aa4699fdef02a7a3647277551a64b42b3e9345aa9dc3","abstract_canon_sha256":"d512b51c4c1019d983a8a16c7974c59cfd59b6171cb3049fbdaac5b192a6f7d5"},"schema_version":"1.0"},"canonical_sha256":"b3359a143d2adc58167964608c5cf615a2000ab3a7e11a211a232ce541b0517c","source":{"kind":"arxiv","id":"1506.02344","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02344","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02344v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02344","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"WM2ZUFB5FLOF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WM2ZUFB5FLOFQFTZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WM2ZUFB5","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WM2ZUFB5FLOFQFTZMRQIYXHWCW","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-08T03:37:36Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"title_canon_sha256":"24020eb1917d3c5f4086aa4699fdef02a7a3647277551a64b42b3e9345aa9dc3","abstract_canon_sha256":"d512b51c4c1019d983a8a16c7974c59cfd59b6171cb3049fbdaac5b192a6f7d5"},"schema_version":"1.0"},"canonical_sha256":"b3359a143d2adc58167964608c5cf615a2000ab3a7e11a211a232ce541b0517c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:47.353426Z","signature_b64":"XXrbSor3zDsHsvq7lrYTj+jP1BJi7KrSqhKaYjse7TXEbqImR8Cz8J7s9JHjURnGb7YZID9/cfqDRMrRYD6sDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3359a143d2adc58167964608c5cf615a2000ab3a7e11a211a232ce541b0517c","last_reissued_at":"2026-05-18T01:42:47.352681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:47.352681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02344","source_version":2,"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:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGBul6aj7UDxkrPGggNAwAhP+L/E3lCtTNe4CQTxRXgOsuR/uQjxkr7xQ1ZtuGncvfEOK8jn5WvFvnysgl4CBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:19:39.626746Z"},"content_sha256":"eb8f77e4a94a201e2232ef2fbc515f0d0ab4c89ffc64b8c634e385b19e57ae46","schema_version":"1.0","event_id":"sha256:eb8f77e4a94a201e2232ef2fbc515f0d0ab4c89ffc64b8c634e385b19e57ae46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WM2ZUFB5FLOFQFTZMRQIYXHWCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stay on path: PCA along graph paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Bharath Chandrasekaran, Han-Gyol Yi and, Megasthenis Asteris","submitted_at":"2015-06-08T03:37:36Z","abstract_excerpt":"We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acyclic graph $G$ on $p$ vertices corresponding to variables, the non-zero entries of the extracted principal component must coincide with vertices lying along a path in $G$.\n  From a statistical perspective, information on the underlying network may potentially reduce the number of observations required to recover the population principal component. We consider the canonical estimator which optimally exploits the prior kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02344","kind":"arxiv","version":2},"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:42:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkLVYu0jkYYCVH2OSAC1RL3iPG3b849IZX9GZpEbF0PnaQAG2+8GZLQu8xukO7L+SN9t6O4QuX3ghJ7OZ0PBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:19:39.627095Z"},"content_sha256":"97be697120391802cdc1f9632fe7b059241383e0a79d59855436ccd6fd0c9e73","schema_version":"1.0","event_id":"sha256:97be697120391802cdc1f9632fe7b059241383e0a79d59855436ccd6fd0c9e73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/bundle.json","state_url":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/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-05T10:19:39Z","links":{"resolver":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW","bundle":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/bundle.json","state":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WM2ZUFB5FLOFQFTZMRQIYXHWCW","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":"d512b51c4c1019d983a8a16c7974c59cfd59b6171cb3049fbdaac5b192a6f7d5","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-08T03:37:36Z","title_canon_sha256":"24020eb1917d3c5f4086aa4699fdef02a7a3647277551a64b42b3e9345aa9dc3"},"schema_version":"1.0","source":{"id":"1506.02344","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02344","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02344v2","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02344","created_at":"2026-05-18T01:42:47Z"},{"alias_kind":"pith_short_12","alias_value":"WM2ZUFB5FLOF","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WM2ZUFB5FLOFQFTZ","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WM2ZUFB5","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:97be697120391802cdc1f9632fe7b059241383e0a79d59855436ccd6fd0c9e73","target":"graph","created_at":"2026-05-18T01:42:47Z","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":"We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acyclic graph $G$ on $p$ vertices corresponding to variables, the non-zero entries of the extracted principal component must coincide with vertices lying along a path in $G$.\n  From a statistical perspective, information on the underlying network may potentially reduce the number of observations required to recover the population principal component. We consider the canonical estimator which optimally exploits the prior kn","authors_text":"Alexandros G. Dimakis, Anastasios Kyrillidis, Bharath Chandrasekaran, Han-Gyol Yi and, Megasthenis Asteris","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-08T03:37:36Z","title":"Stay on path: PCA along graph paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02344","kind":"arxiv","version":2},"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:eb8f77e4a94a201e2232ef2fbc515f0d0ab4c89ffc64b8c634e385b19e57ae46","target":"record","created_at":"2026-05-18T01:42:47Z","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":"d512b51c4c1019d983a8a16c7974c59cfd59b6171cb3049fbdaac5b192a6f7d5","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-08T03:37:36Z","title_canon_sha256":"24020eb1917d3c5f4086aa4699fdef02a7a3647277551a64b42b3e9345aa9dc3"},"schema_version":"1.0","source":{"id":"1506.02344","kind":"arxiv","version":2}},"canonical_sha256":"b3359a143d2adc58167964608c5cf615a2000ab3a7e11a211a232ce541b0517c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3359a143d2adc58167964608c5cf615a2000ab3a7e11a211a232ce541b0517c","first_computed_at":"2026-05-18T01:42:47.352681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:47.352681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XXrbSor3zDsHsvq7lrYTj+jP1BJi7KrSqhKaYjse7TXEbqImR8Cz8J7s9JHjURnGb7YZID9/cfqDRMrRYD6sDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:47.353426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02344","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb8f77e4a94a201e2232ef2fbc515f0d0ab4c89ffc64b8c634e385b19e57ae46","sha256:97be697120391802cdc1f9632fe7b059241383e0a79d59855436ccd6fd0c9e73"],"state_sha256":"9c3aec33ac63fa0e476d35471f1a44ca01eb0b9e6c5d97a2693503beec34482b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j71Q06t1wsh8VtU6YR8kPYL2dTw1Oc2vLVyuuZNPAT8imTUAmgfeTkBu5+GjwaZiotu5ZwEQq2k1Q2itckBuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:19:39.628997Z","bundle_sha256":"167d11f43bd69e1a5d79b2edbd279af2db8243ed2d7d3bd17edbb34afce4d8d6"}}