{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OUYXZUHEC7AJSBRUNCIWPIKY4U","short_pith_number":"pith:OUYXZUHE","canonical_record":{"source":{"id":"1203.3492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b335a9ea652dd2c3aca56cd755086de46139a3235aa3362d574dbdb1afb77b18","abstract_canon_sha256":"d6031baaf9dcf30b2f3cd598ab1d63ba6e4b0766d71a66fd7df350603a61a606"},"schema_version":"1.0"},"canonical_sha256":"75317cd0e417c0990634689167a158e51b82cb060c381e16b3ac785e70af75f9","source":{"kind":"arxiv","id":"1203.3492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3492","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3492v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3492","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"OUYXZUHEC7AJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OUYXZUHEC7AJSBRU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OUYXZUHE","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OUYXZUHEC7AJSBRUNCIWPIKY4U","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b335a9ea652dd2c3aca56cd755086de46139a3235aa3362d574dbdb1afb77b18","abstract_canon_sha256":"d6031baaf9dcf30b2f3cd598ab1d63ba6e4b0766d71a66fd7df350603a61a606"},"schema_version":"1.0"},"canonical_sha256":"75317cd0e417c0990634689167a158e51b82cb060c381e16b3ac785e70af75f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.277100Z","signature_b64":"e9qaKpYBL4+8qf2agdsCBEfew1yPEGKy4+BgQq0gX4jLhEqG5GrT4gaWxq32flxgxKC3qGG3jXaJc5lkbFRVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75317cd0e417c0990634689167a158e51b82cb060c381e16b3ac785e70af75f9","last_reissued_at":"2026-05-18T04:00:00.276343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.276343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3492","source_version":1,"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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QunPMLihWWkjyRIpTfS3hnygAR5NFs+1IMdqb+OjHVrltTMMoWpoSjXfA7N3O3CpB7/A5r9hNICeab+XKLx5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:15:13.504753Z"},"content_sha256":"96a16eb50a4640cee4d7681cf95570c3be8c42eab27f41db79747c27e5b2386e","schema_version":"1.0","event_id":"sha256:96a16eb50a4640cee4d7681cf95570c3be8c42eab27f41db79747c27e5b2386e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OUYXZUHEC7AJSBRUNCIWPIKY4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Higher-Order Distances Using Random Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Michael W. Mahoney, Ping Li, Yiyuan She","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, storing, computing, and retrieving the distances can be both space and time prohibitive. Efficient algorithms exist for estimating lp distances if 0 < p <= 2. The task for p > 2 is known to be difficult. Our work partially fills this gap."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3492","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":""},"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-18T04:00:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G4MsnYfqzbfgZSlypwIZE4TWPgD2DArLsKNjcNKZ8AOvfgYMZk+h0FcHCJHgA0dB+Hfk+QlqG5qYX05KJyftBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T02:15:13.505097Z"},"content_sha256":"890a4288be5b612878cdb6344cfff6ef9463c33eb42517d1f218e6bab44dcb99","schema_version":"1.0","event_id":"sha256:890a4288be5b612878cdb6344cfff6ef9463c33eb42517d1f218e6bab44dcb99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U/bundle.json","state_url":"https://pith.science/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U/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-07-05T02:15:13Z","links":{"resolver":"https://pith.science/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U","bundle":"https://pith.science/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U/bundle.json","state":"https://pith.science/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUYXZUHEC7AJSBRUNCIWPIKY4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OUYXZUHEC7AJSBRUNCIWPIKY4U","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":"d6031baaf9dcf30b2f3cd598ab1d63ba6e4b0766d71a66fd7df350603a61a606","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"b335a9ea652dd2c3aca56cd755086de46139a3235aa3362d574dbdb1afb77b18"},"schema_version":"1.0","source":{"id":"1203.3492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3492","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3492v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3492","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"OUYXZUHEC7AJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OUYXZUHEC7AJSBRU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OUYXZUHE","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:890a4288be5b612878cdb6344cfff6ef9463c33eb42517d1f218e6bab44dcb99","target":"graph","created_at":"2026-05-18T04:00:00Z","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 provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, storing, computing, and retrieving the distances can be both space and time prohibitive. Efficient algorithms exist for estimating lp distances if 0 < p <= 2. The task for p > 2 is known to be difficult. Our work partially fills this gap.","authors_text":"Michael W. Mahoney, Ping Li, Yiyuan She","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title":"Approximating Higher-Order Distances Using Random Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3492","kind":"arxiv","version":1},"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:96a16eb50a4640cee4d7681cf95570c3be8c42eab27f41db79747c27e5b2386e","target":"record","created_at":"2026-05-18T04:00:00Z","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":"d6031baaf9dcf30b2f3cd598ab1d63ba6e4b0766d71a66fd7df350603a61a606","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"b335a9ea652dd2c3aca56cd755086de46139a3235aa3362d574dbdb1afb77b18"},"schema_version":"1.0","source":{"id":"1203.3492","kind":"arxiv","version":1}},"canonical_sha256":"75317cd0e417c0990634689167a158e51b82cb060c381e16b3ac785e70af75f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75317cd0e417c0990634689167a158e51b82cb060c381e16b3ac785e70af75f9","first_computed_at":"2026-05-18T04:00:00.276343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.276343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e9qaKpYBL4+8qf2agdsCBEfew1yPEGKy4+BgQq0gX4jLhEqG5GrT4gaWxq32flxgxKC3qGG3jXaJc5lkbFRVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.277100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a16eb50a4640cee4d7681cf95570c3be8c42eab27f41db79747c27e5b2386e","sha256:890a4288be5b612878cdb6344cfff6ef9463c33eb42517d1f218e6bab44dcb99"],"state_sha256":"2fc8d46187f0a8f42ea042af9b111294d3df12077815a57241ee6a5f2f686909"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"600vmAZdqt3/7HDKlW1k7Rq70HE+za1Iqyyv5c9ZtTnS+A6dxpw7cG+bHfCEpujDnfpizz69Rq7dXEMM86nnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T02:15:13.507144Z","bundle_sha256":"3895122f45870d46515d3240f9e22a3c9e11fdc750cda3062c4948295dffaed9"}}