{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:R5OILMP3PQBC6UDXKRJFSUCVL3","short_pith_number":"pith:R5OILMP3","canonical_record":{"source":{"id":"2504.05426","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-07T18:50:11Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"aac86455609a9205443332eca6e013388d7efee3f97e9052b18d2105bc232a07","abstract_canon_sha256":"4520a750d7732dce48dd6b4657cba6ee86563efcd3fa5c9eb8ff1f16a764483d"},"schema_version":"1.0"},"canonical_sha256":"8f5c85b1fb7c022f507754525950555ed8b2be203965b60c3d9dea41a31b0881","source":{"kind":"arxiv","id":"2504.05426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05426","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05426v2","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05426","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"R5OILMP3PQBC","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"pith_short_16","alias_value":"R5OILMP3PQBC6UDX","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"pith_short_8","alias_value":"R5OILMP3","created_at":"2026-07-05T11:21:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:R5OILMP3PQBC6UDXKRJFSUCVL3","target":"record","payload":{"canonical_record":{"source":{"id":"2504.05426","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-07T18:50:11Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"aac86455609a9205443332eca6e013388d7efee3f97e9052b18d2105bc232a07","abstract_canon_sha256":"4520a750d7732dce48dd6b4657cba6ee86563efcd3fa5c9eb8ff1f16a764483d"},"schema_version":"1.0"},"canonical_sha256":"8f5c85b1fb7c022f507754525950555ed8b2be203965b60c3d9dea41a31b0881","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:45.284330Z","signature_b64":"pRpQmi6XF9z812/FPJZ45KVqNwWqosNjSZHsn5sr6Md+nJumSQJOOUASXWRzeAWCHnCPylZcoVEgzDDk9rrwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f5c85b1fb7c022f507754525950555ed8b2be203965b60c3d9dea41a31b0881","last_reissued_at":"2026-07-05T11:21:45.283694Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:45.283694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.05426","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-07-05T11:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dJBqOl4eb4OLl6QzJz4EAXMAkYHXVmG79sEpR6ZcDrrN0cero4sYgWXS5FCkovKwfRElUjxNqUPxIOlikZNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:57:00.067742Z"},"content_sha256":"dcf1ece19bbf113d3a8e16ea86a2afdf5f56d3ffe1ce2e62dde0f4839f9ffa95","schema_version":"1.0","event_id":"sha256:dcf1ece19bbf113d3a8e16ea86a2afdf5f56d3ffe1ce2e62dde0f4839f9ffa95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:R5OILMP3PQBC6UDXKRJFSUCVL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Survey on Algorithms for multi-index models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Daniel Hsu, Joan Bruna","submitted_at":"2025-04-07T18:50:11Z","abstract_excerpt":"We review the literature on algorithms for estimating the index space in a multi-index model. The primary focus is on computationally efficient (polynomial-time) algorithms in Gaussian space, the assumptions under which consistency is guaranteed by these methods, and their sample complexity. In many cases, a gap is observed between the sample complexity of the best known computationally efficient methods and the information-theoretical minimum. We also review algorithms based on estimating the span of gradients using nonparametric methods, and algorithms based on fitting neural networks using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05426","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.05426/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:21:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2LYHOcdtDJMl6/YX8EmI6jaBSuzfCwfZoeGa37xPEnWweY7oBGirakfQ2S/Y1FlAFElPF2//xNWEHkGgEpFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:57:00.068132Z"},"content_sha256":"867b5f4afb5b1efc6b44518db53c16e8a7971857e5e18c5285d50ae3e71b72a6","schema_version":"1.0","event_id":"sha256:867b5f4afb5b1efc6b44518db53c16e8a7971857e5e18c5285d50ae3e71b72a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5OILMP3PQBC6UDXKRJFSUCVL3/bundle.json","state_url":"https://pith.science/pith/R5OILMP3PQBC6UDXKRJFSUCVL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5OILMP3PQBC6UDXKRJFSUCVL3/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-08-04T09:57:00Z","links":{"resolver":"https://pith.science/pith/R5OILMP3PQBC6UDXKRJFSUCVL3","bundle":"https://pith.science/pith/R5OILMP3PQBC6UDXKRJFSUCVL3/bundle.json","state":"https://pith.science/pith/R5OILMP3PQBC6UDXKRJFSUCVL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5OILMP3PQBC6UDXKRJFSUCVL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R5OILMP3PQBC6UDXKRJFSUCVL3","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":"4520a750d7732dce48dd6b4657cba6ee86563efcd3fa5c9eb8ff1f16a764483d","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-07T18:50:11Z","title_canon_sha256":"aac86455609a9205443332eca6e013388d7efee3f97e9052b18d2105bc232a07"},"schema_version":"1.0","source":{"id":"2504.05426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.05426","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"arxiv_version","alias_value":"2504.05426v2","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05426","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"pith_short_12","alias_value":"R5OILMP3PQBC","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"pith_short_16","alias_value":"R5OILMP3PQBC6UDX","created_at":"2026-07-05T11:21:45Z"},{"alias_kind":"pith_short_8","alias_value":"R5OILMP3","created_at":"2026-07-05T11:21:45Z"}],"graph_snapshots":[{"event_id":"sha256:867b5f4afb5b1efc6b44518db53c16e8a7971857e5e18c5285d50ae3e71b72a6","target":"graph","created_at":"2026-07-05T11:21:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.05426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We review the literature on algorithms for estimating the index space in a multi-index model. The primary focus is on computationally efficient (polynomial-time) algorithms in Gaussian space, the assumptions under which consistency is guaranteed by these methods, and their sample complexity. In many cases, a gap is observed between the sample complexity of the best known computationally efficient methods and the information-theoretical minimum. We also review algorithms based on estimating the span of gradients using nonparametric methods, and algorithms based on fitting neural networks using ","authors_text":"Daniel Hsu, Joan Bruna","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-07T18:50:11Z","title":"Survey on Algorithms for multi-index models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05426","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:dcf1ece19bbf113d3a8e16ea86a2afdf5f56d3ffe1ce2e62dde0f4839f9ffa95","target":"record","created_at":"2026-07-05T11:21:45Z","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":"4520a750d7732dce48dd6b4657cba6ee86563efcd3fa5c9eb8ff1f16a764483d","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-04-07T18:50:11Z","title_canon_sha256":"aac86455609a9205443332eca6e013388d7efee3f97e9052b18d2105bc232a07"},"schema_version":"1.0","source":{"id":"2504.05426","kind":"arxiv","version":2}},"canonical_sha256":"8f5c85b1fb7c022f507754525950555ed8b2be203965b60c3d9dea41a31b0881","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f5c85b1fb7c022f507754525950555ed8b2be203965b60c3d9dea41a31b0881","first_computed_at":"2026-07-05T11:21:45.283694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:45.283694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pRpQmi6XF9z812/FPJZ45KVqNwWqosNjSZHsn5sr6Md+nJumSQJOOUASXWRzeAWCHnCPylZcoVEgzDDk9rrwAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:45.284330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.05426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcf1ece19bbf113d3a8e16ea86a2afdf5f56d3ffe1ce2e62dde0f4839f9ffa95","sha256:867b5f4afb5b1efc6b44518db53c16e8a7971857e5e18c5285d50ae3e71b72a6"],"state_sha256":"fb01101ee0338a2acafe80e851c4fb8225bcaf17e445e5bc8a2e4d422237f7e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bqH45WFut1pDpLOaPRzhhsmOKmP/08t7QRKrxWHvOu41orjcFwO5AM8Ry/gDTbL8Lbhgb8MAQJ1lrwPedrz2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:57:00.070994Z","bundle_sha256":"bda63877c87ba8c4df01ce6fd45a1a25f66132aedc95c5987ead59d3d260b0be"}}