{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2GNXEPPXEAZPYELDJRW2CXJCJD","short_pith_number":"pith:2GNXEPPX","canonical_record":{"source":{"id":"1312.0803","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-03T12:56:46Z","cross_cats_sorted":[],"title_canon_sha256":"0fc50f274097876f02ad60a3b5c7efaff545b3c3898559411d78496adee9425b","abstract_canon_sha256":"27de0ab4f6864996a20a998bb319bb50857b9f68a5da55052c98a74cfa36838c"},"schema_version":"1.0"},"canonical_sha256":"d19b723df72032fc11634c6da15d2248c258083bfc78ec7060b002a3d4bc12ed","source":{"kind":"arxiv","id":"1312.0803","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0803","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0803v3","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0803","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"2GNXEPPXEAZP","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2GNXEPPXEAZPYELD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2GNXEPPX","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2GNXEPPXEAZPYELDJRW2CXJCJD","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0803","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-03T12:56:46Z","cross_cats_sorted":[],"title_canon_sha256":"0fc50f274097876f02ad60a3b5c7efaff545b3c3898559411d78496adee9425b","abstract_canon_sha256":"27de0ab4f6864996a20a998bb319bb50857b9f68a5da55052c98a74cfa36838c"},"schema_version":"1.0"},"canonical_sha256":"d19b723df72032fc11634c6da15d2248c258083bfc78ec7060b002a3d4bc12ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:46.687772Z","signature_b64":"dgs1jAxgRk3PXsbfB90/P7KBrqalH6S1sH0deYlJ4cS10i0hcsiaKF2V7ZwNyxian4Q5zlOOBlf6Ybh26P4/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d19b723df72032fc11634c6da15d2248c258083bfc78ec7060b002a3d4bc12ed","last_reissued_at":"2026-05-18T02:54:46.687270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:46.687270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0803","source_version":3,"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-18T02:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rqf5LjyDbRRoBuWT+GddivA6ovnnuOBkz7SbMMOFWVY8NKFwMB9XUJgbe6n6RvZWRs73T1G7ipkWJao8FNVoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:14:10.438146Z"},"content_sha256":"fcbbbe6e14df89729fcf653d0b3cd3efbfe7cbb0242c252712672efb52c25172","schema_version":"1.0","event_id":"sha256:fcbbbe6e14df89729fcf653d0b3cd3efbfe7cbb0242c252712672efb52c25172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2GNXEPPXEAZPYELDJRW2CXJCJD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonlinear Dimensionality Reduction via Path-Based Isometric Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amir Joudaki, Amir Najafi, Emad Fatemizadeh","submitted_at":"2013-12-03T12:56:46Z","abstract_excerpt":"Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which render them inapplicable to large-scale datasets. To leverage such cases we propose a new method called \"Path-Based Isomap\". Similar to Isomap, we exploit geodesic paths to find the low-dimensional embedding. However, instead of preserving pairwise geodesic distances, the low-dimensional embedding is computed via a path-mapping algorithm. Due to the much fewe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0803","kind":"arxiv","version":3},"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-18T02:54:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zcx9Q/nO9B3yr0HcL6sHqH9DsfgqqkhpFwMQiMWRf6y44OiwSfEKTFnTxI8tG3ljJWVi4PDPcMod6Swly8gkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:14:10.438661Z"},"content_sha256":"1dcd0cf01ba087de14debe434d257ec284906b55da76f21e80f53e39b8b28532","schema_version":"1.0","event_id":"sha256:1dcd0cf01ba087de14debe434d257ec284906b55da76f21e80f53e39b8b28532"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GNXEPPXEAZPYELDJRW2CXJCJD/bundle.json","state_url":"https://pith.science/pith/2GNXEPPXEAZPYELDJRW2CXJCJD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GNXEPPXEAZPYELDJRW2CXJCJD/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-05-27T23:14:10Z","links":{"resolver":"https://pith.science/pith/2GNXEPPXEAZPYELDJRW2CXJCJD","bundle":"https://pith.science/pith/2GNXEPPXEAZPYELDJRW2CXJCJD/bundle.json","state":"https://pith.science/pith/2GNXEPPXEAZPYELDJRW2CXJCJD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GNXEPPXEAZPYELDJRW2CXJCJD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2GNXEPPXEAZPYELDJRW2CXJCJD","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":"27de0ab4f6864996a20a998bb319bb50857b9f68a5da55052c98a74cfa36838c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-03T12:56:46Z","title_canon_sha256":"0fc50f274097876f02ad60a3b5c7efaff545b3c3898559411d78496adee9425b"},"schema_version":"1.0","source":{"id":"1312.0803","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0803","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0803v3","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0803","created_at":"2026-05-18T02:54:46Z"},{"alias_kind":"pith_short_12","alias_value":"2GNXEPPXEAZP","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2GNXEPPXEAZPYELD","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2GNXEPPX","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:1dcd0cf01ba087de14debe434d257ec284906b55da76f21e80f53e39b8b28532","target":"graph","created_at":"2026-05-18T02:54:46Z","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":"Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which render them inapplicable to large-scale datasets. To leverage such cases we propose a new method called \"Path-Based Isomap\". Similar to Isomap, we exploit geodesic paths to find the low-dimensional embedding. However, instead of preserving pairwise geodesic distances, the low-dimensional embedding is computed via a path-mapping algorithm. Due to the much fewe","authors_text":"Amir Joudaki, Amir Najafi, Emad Fatemizadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-03T12:56:46Z","title":"Nonlinear Dimensionality Reduction via Path-Based Isometric Mapping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0803","kind":"arxiv","version":3},"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:fcbbbe6e14df89729fcf653d0b3cd3efbfe7cbb0242c252712672efb52c25172","target":"record","created_at":"2026-05-18T02:54:46Z","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":"27de0ab4f6864996a20a998bb319bb50857b9f68a5da55052c98a74cfa36838c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-03T12:56:46Z","title_canon_sha256":"0fc50f274097876f02ad60a3b5c7efaff545b3c3898559411d78496adee9425b"},"schema_version":"1.0","source":{"id":"1312.0803","kind":"arxiv","version":3}},"canonical_sha256":"d19b723df72032fc11634c6da15d2248c258083bfc78ec7060b002a3d4bc12ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d19b723df72032fc11634c6da15d2248c258083bfc78ec7060b002a3d4bc12ed","first_computed_at":"2026-05-18T02:54:46.687270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:46.687270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dgs1jAxgRk3PXsbfB90/P7KBrqalH6S1sH0deYlJ4cS10i0hcsiaKF2V7ZwNyxian4Q5zlOOBlf6Ybh26P4/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:46.687772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0803","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcbbbe6e14df89729fcf653d0b3cd3efbfe7cbb0242c252712672efb52c25172","sha256:1dcd0cf01ba087de14debe434d257ec284906b55da76f21e80f53e39b8b28532"],"state_sha256":"25b1969fda80ebac9165a3dd213cc0d2b7ca48a15e7bbc3231eb0636c47228ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4qqw4YY6KSxmEinxsIFI8jTH+mL77SjrEdQNweKsWaiXVnSxnwKkmSfJ3hPU92VRkrwOPmvXfXrU2TzU6AyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:14:10.441600Z","bundle_sha256":"f271445af5a8ec876a9b2c0bc2f8135b610fa1de6c5ab11d5b92d2b948cdd02c"}}