{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WM2ZUFB5FLOFQFTZMRQIYXHWCW","short_pith_number":"pith:WM2ZUFB5","schema_version":"1.0","canonical_sha256":"b3359a143d2adc58167964608c5cf615a2000ab3a7e11a211a232ce541b0517c","source":{"kind":"arxiv","id":"1506.02344","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02344","created_at":"2026-05-18T01:42:47.352806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02344v2","created_at":"2026-05-18T01:42:47.352806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02344","created_at":"2026-05-18T01:42:47.352806+00:00"},{"alias_kind":"pith_short_12","alias_value":"WM2ZUFB5FLOF","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WM2ZUFB5FLOFQFTZ","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WM2ZUFB5","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW","json":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW.json","graph_json":"https://pith.science/api/pith-number/WM2ZUFB5FLOFQFTZMRQIYXHWCW/graph.json","events_json":"https://pith.science/api/pith-number/WM2ZUFB5FLOFQFTZMRQIYXHWCW/events.json","paper":"https://pith.science/paper/WM2ZUFB5"},"agent_actions":{"view_html":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW","download_json":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW.json","view_paper":"https://pith.science/paper/WM2ZUFB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02344&json=true","fetch_graph":"https://pith.science/api/pith-number/WM2ZUFB5FLOFQFTZMRQIYXHWCW/graph.json","fetch_events":"https://pith.science/api/pith-number/WM2ZUFB5FLOFQFTZMRQIYXHWCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/action/storage_attestation","attest_author":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/action/author_attestation","sign_citation":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/action/citation_signature","submit_replication":"https://pith.science/pith/WM2ZUFB5FLOFQFTZMRQIYXHWCW/action/replication_record"}},"created_at":"2026-05-18T01:42:47.352806+00:00","updated_at":"2026-05-18T01:42:47.352806+00:00"}