{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3FBBHBNWLXIUL2QU72AUFD4PRV","short_pith_number":"pith:3FBBHBNW","schema_version":"1.0","canonical_sha256":"d9421385b65dd145ea14fe81428f8f8d410979f9ea424828e0e1a62db6be0c06","source":{"kind":"arxiv","id":"2507.10710","version":1},"attestation_state":"computed","paper":{"title":"Robust Multi-Manifold Clustering via Simplex Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akin Narayan, Anna Little, Haoyu Chen","submitted_at":"2025-07-14T18:22:50Z","abstract_excerpt":"This article introduces a novel, geometric approach for multi-manifold clustering (MMC), i.e. for clustering a collection of potentially intersecting, d-dimensional manifolds into the individual manifold components. We first compute a locality graph on d-simplices, using the dihedral angle in between adjacent simplices as the graph weights, and then compute infinity path distances in this simplex graph. This procedure gives a metric on simplices which we refer to as the largest angle path distance (LAPD). We analyze the properties of LAPD under random sampling, and prove that with an appropria"},"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":"2507.10710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-07-14T18:22:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bc23b66175c9ce70adb2dafd2291873238b215e4c9534e8ced1c895b33e93794","abstract_canon_sha256":"8f8c8e4849a845130170920f1047e25fb8076a72015e21a53aafb3742f31bbbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:58.785063Z","signature_b64":"p2Zm6eYGYX23WbBKY2x6CtVrGE86SOfs+eAvG9/jUYyHOFxAKGLR2r8QbRWicB91bPmB2HDH9e0hAjPfPb+sDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9421385b65dd145ea14fe81428f8f8d410979f9ea424828e0e1a62db6be0c06","last_reissued_at":"2026-07-05T11:36:58.784605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:58.784605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Multi-Manifold Clustering via Simplex Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akin Narayan, Anna Little, Haoyu Chen","submitted_at":"2025-07-14T18:22:50Z","abstract_excerpt":"This article introduces a novel, geometric approach for multi-manifold clustering (MMC), i.e. for clustering a collection of potentially intersecting, d-dimensional manifolds into the individual manifold components. We first compute a locality graph on d-simplices, using the dihedral angle in between adjacent simplices as the graph weights, and then compute infinity path distances in this simplex graph. This procedure gives a metric on simplices which we refer to as the largest angle path distance (LAPD). We analyze the properties of LAPD under random sampling, and prove that with an appropria"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10710","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.10710/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.10710","created_at":"2026-07-05T11:36:58.784667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.10710v1","created_at":"2026-07-05T11:36:58.784667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10710","created_at":"2026-07-05T11:36:58.784667+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FBBHBNWLXIU","created_at":"2026-07-05T11:36:58.784667+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FBBHBNWLXIUL2QU","created_at":"2026-07-05T11:36:58.784667+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FBBHBNW","created_at":"2026-07-05T11:36:58.784667+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/3FBBHBNWLXIUL2QU72AUFD4PRV","json":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV.json","graph_json":"https://pith.science/api/pith-number/3FBBHBNWLXIUL2QU72AUFD4PRV/graph.json","events_json":"https://pith.science/api/pith-number/3FBBHBNWLXIUL2QU72AUFD4PRV/events.json","paper":"https://pith.science/paper/3FBBHBNW"},"agent_actions":{"view_html":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV","download_json":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV.json","view_paper":"https://pith.science/paper/3FBBHBNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.10710&json=true","fetch_graph":"https://pith.science/api/pith-number/3FBBHBNWLXIUL2QU72AUFD4PRV/graph.json","fetch_events":"https://pith.science/api/pith-number/3FBBHBNWLXIUL2QU72AUFD4PRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV/action/storage_attestation","attest_author":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV/action/author_attestation","sign_citation":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV/action/citation_signature","submit_replication":"https://pith.science/pith/3FBBHBNWLXIUL2QU72AUFD4PRV/action/replication_record"}},"created_at":"2026-07-05T11:36:58.784667+00:00","updated_at":"2026-07-05T11:36:58.784667+00:00"}