{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BZEPJVJAZBGTLBDY4QGRTANG7K","short_pith_number":"pith:BZEPJVJA","canonical_record":{"source":{"id":"1602.06245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-19T18:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"5eaf3be8d3819550aea9b2650dd34f19e19f9912386c7219968a0b22488c754e","abstract_canon_sha256":"c94dac08f9c8052034c7e10fd8b9360851f9663679c47efd54b9609bce417d20"},"schema_version":"1.0"},"canonical_sha256":"0e48f4d520c84d358478e40d1981a6fa90cd02543e66a651a026c100833b31ab","source":{"kind":"arxiv","id":"1602.06245","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06245","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06245v2","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06245","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"BZEPJVJAZBGT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZEPJVJAZBGTLBDY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZEPJVJA","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BZEPJVJAZBGTLBDY4QGRTANG7K","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-19T18:19:05Z","cross_cats_sorted":[],"title_canon_sha256":"5eaf3be8d3819550aea9b2650dd34f19e19f9912386c7219968a0b22488c754e","abstract_canon_sha256":"c94dac08f9c8052034c7e10fd8b9360851f9663679c47efd54b9609bce417d20"},"schema_version":"1.0"},"canonical_sha256":"0e48f4d520c84d358478e40d1981a6fa90cd02543e66a651a026c100833b31ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.895733Z","signature_b64":"DR8rWJi0vdy0Pt5KSoeHqAP58izfFlF0OlhwotRKGIVfNSjHA4a9LClSCiCe2qIyzoXC55whA6w02B3acxpFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e48f4d520c84d358478e40d1981a6fa90cd02543e66a651a026c100833b31ab","last_reissued_at":"2026-05-18T01:19:52.895190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.895190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06245","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:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TE7CM4yfYVNdSHpJnBE/p2YFp1hKc50lGbAG1FRouzdYNNuupUemnPx88ePWkT3DYZ03shZ4//I4TNecI1rlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:15:10.432833Z"},"content_sha256":"55a78f0407ee23c2da7e4f8adf1039f9b0b7310bb0b1377b2087bf363ccb898c","schema_version":"1.0","event_id":"sha256:55a78f0407ee23c2da7e4f8adf1039f9b0b7310bb0b1377b2087bf363ccb898c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BZEPJVJAZBGTLBDY4QGRTANG7K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaffoldings and Spines: Organizing High-Dimensional Data Using Cover Trees, Local Principal Component Analysis, and Persistent Homology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christopher J. Tralie, Ellen Gasparovic, John Harer, Paul Bendich","submitted_at":"2016-02-19T18:19:05Z","abstract_excerpt":"We propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a combination of multi-scale local principal component analysis and topological data analysis. The resulting cover tree nodes consist of points within or near the same stratum of the stratified space. They are then connected to form a \\emph{scaffolding} graph, which is then simplified and collapsed down into a \\emph{spine} graph. From this latter graph the stratified "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06245","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:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oXe3ehMy7LpD4intHG9/BPOuWmaquGMde7iXa7yXHa+XO1qRiTBPhswYyhhYMXU0uvfwoDBU9ikiH1poeQZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:15:10.433172Z"},"content_sha256":"84d552bbcf44bffad371e295340e2997d830520d109bdd73bf68b5c43f77659a","schema_version":"1.0","event_id":"sha256:84d552bbcf44bffad371e295340e2997d830520d109bdd73bf68b5c43f77659a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZEPJVJAZBGTLBDY4QGRTANG7K/bundle.json","state_url":"https://pith.science/pith/BZEPJVJAZBGTLBDY4QGRTANG7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZEPJVJAZBGTLBDY4QGRTANG7K/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-05T11:15:10Z","links":{"resolver":"https://pith.science/pith/BZEPJVJAZBGTLBDY4QGRTANG7K","bundle":"https://pith.science/pith/BZEPJVJAZBGTLBDY4QGRTANG7K/bundle.json","state":"https://pith.science/pith/BZEPJVJAZBGTLBDY4QGRTANG7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZEPJVJAZBGTLBDY4QGRTANG7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BZEPJVJAZBGTLBDY4QGRTANG7K","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":"c94dac08f9c8052034c7e10fd8b9360851f9663679c47efd54b9609bce417d20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-19T18:19:05Z","title_canon_sha256":"5eaf3be8d3819550aea9b2650dd34f19e19f9912386c7219968a0b22488c754e"},"schema_version":"1.0","source":{"id":"1602.06245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06245","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06245v2","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06245","created_at":"2026-05-18T01:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"BZEPJVJAZBGT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZEPJVJAZBGTLBDY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZEPJVJA","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:84d552bbcf44bffad371e295340e2997d830520d109bdd73bf68b5c43f77659a","target":"graph","created_at":"2026-05-18T01:19:52Z","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 propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a combination of multi-scale local principal component analysis and topological data analysis. The resulting cover tree nodes consist of points within or near the same stratum of the stratified space. They are then connected to form a \\emph{scaffolding} graph, which is then simplified and collapsed down into a \\emph{spine} graph. From this latter graph the stratified ","authors_text":"Christopher J. Tralie, Ellen Gasparovic, John Harer, Paul Bendich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-19T18:19:05Z","title":"Scaffoldings and Spines: Organizing High-Dimensional Data Using Cover Trees, Local Principal Component Analysis, and Persistent Homology"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06245","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:55a78f0407ee23c2da7e4f8adf1039f9b0b7310bb0b1377b2087bf363ccb898c","target":"record","created_at":"2026-05-18T01:19:52Z","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":"c94dac08f9c8052034c7e10fd8b9360851f9663679c47efd54b9609bce417d20","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-19T18:19:05Z","title_canon_sha256":"5eaf3be8d3819550aea9b2650dd34f19e19f9912386c7219968a0b22488c754e"},"schema_version":"1.0","source":{"id":"1602.06245","kind":"arxiv","version":2}},"canonical_sha256":"0e48f4d520c84d358478e40d1981a6fa90cd02543e66a651a026c100833b31ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e48f4d520c84d358478e40d1981a6fa90cd02543e66a651a026c100833b31ab","first_computed_at":"2026-05-18T01:19:52.895190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:52.895190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DR8rWJi0vdy0Pt5KSoeHqAP58izfFlF0OlhwotRKGIVfNSjHA4a9LClSCiCe2qIyzoXC55whA6w02B3acxpFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:52.895733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55a78f0407ee23c2da7e4f8adf1039f9b0b7310bb0b1377b2087bf363ccb898c","sha256:84d552bbcf44bffad371e295340e2997d830520d109bdd73bf68b5c43f77659a"],"state_sha256":"6e364c896f525be487e04cdb8542f352eccb885c23a9ef023f166a2ee4a99b4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEvKqv50EXS1G7L56typNI5i9ffqo84fgHK/Nd0cFUIzuPIfDaG7ICTL/rroGxYA7FMjqCfakjoish3UqhyBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:15:10.435091Z","bundle_sha256":"3492aa7cd27963c012532165d0a5d27e930917fac83a6d4ca0b01b10fd2363d3"}}