{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:CEMHYS3UYKN6ISZTT547UUG7F7","short_pith_number":"pith:CEMHYS3U","schema_version":"1.0","canonical_sha256":"11187c4b74c29be44b339f79fa50df2fd476b55b97d32833b6b239bab038c0df","source":{"kind":"arxiv","id":"2205.15059","version":4},"attestation_state":"computed","paper":{"title":"Hilbert Curve Projection Distance for Distribution Comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng Meng, Hongteng Xu, Jun Yu, Tao Li","submitted_at":"2022-05-30T12:40:32Z","abstract_excerpt":"Distribution comparison plays a central role in many machine learning tasks like data classification and generative modeling. In this study, we propose a novel metric, called Hilbert curve projection (HCP) distance, to measure the distance between two probability distributions with low complexity. In particular, we first project two high-dimensional probability distributions using Hilbert curve to obtain a coupling between them, and then calculate the transport distance between these two distributions in the original space, according to the coupling. We show that HCP distance is a proper metri"},"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":"2205.15059","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-30T12:40:32Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"98fbdbe3a6e40805c50bcdc149e7eaab20681816cbf07ee302bcb4ad73ac523a","abstract_canon_sha256":"d1d84eb80bb6ea47a6885a384f3f9896ccb3da7bbfa8475f923bf9b4a26d2201"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:36.512756Z","signature_b64":"iStEqzpjdRyEL4iSTA9RsAyIKcFxHDgPf+D9Y70tUZERBWwT41XZWMYx3SitC6s+JQbguX8iapdUFGQQ6nr1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11187c4b74c29be44b339f79fa50df2fd476b55b97d32833b6b239bab038c0df","last_reissued_at":"2026-07-05T07:41:36.512188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:36.512188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hilbert Curve Projection Distance for Distribution Comparison","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng Meng, Hongteng Xu, Jun Yu, Tao Li","submitted_at":"2022-05-30T12:40:32Z","abstract_excerpt":"Distribution comparison plays a central role in many machine learning tasks like data classification and generative modeling. In this study, we propose a novel metric, called Hilbert curve projection (HCP) distance, to measure the distance between two probability distributions with low complexity. In particular, we first project two high-dimensional probability distributions using Hilbert curve to obtain a coupling between them, and then calculate the transport distance between these two distributions in the original space, according to the coupling. We show that HCP distance is a proper metri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15059","kind":"arxiv","version":4},"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/2205.15059/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":"2205.15059","created_at":"2026-07-05T07:41:36.512279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.15059v4","created_at":"2026-07-05T07:41:36.512279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15059","created_at":"2026-07-05T07:41:36.512279+00:00"},{"alias_kind":"pith_short_12","alias_value":"CEMHYS3UYKN6","created_at":"2026-07-05T07:41:36.512279+00:00"},{"alias_kind":"pith_short_16","alias_value":"CEMHYS3UYKN6ISZT","created_at":"2026-07-05T07:41:36.512279+00:00"},{"alias_kind":"pith_short_8","alias_value":"CEMHYS3U","created_at":"2026-07-05T07:41:36.512279+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2306.06581","citing_title":"Importance Sparsification for Sinkhorn Algorithm","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7","json":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7.json","graph_json":"https://pith.science/api/pith-number/CEMHYS3UYKN6ISZTT547UUG7F7/graph.json","events_json":"https://pith.science/api/pith-number/CEMHYS3UYKN6ISZTT547UUG7F7/events.json","paper":"https://pith.science/paper/CEMHYS3U"},"agent_actions":{"view_html":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7","download_json":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7.json","view_paper":"https://pith.science/paper/CEMHYS3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.15059&json=true","fetch_graph":"https://pith.science/api/pith-number/CEMHYS3UYKN6ISZTT547UUG7F7/graph.json","fetch_events":"https://pith.science/api/pith-number/CEMHYS3UYKN6ISZTT547UUG7F7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7/action/storage_attestation","attest_author":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7/action/author_attestation","sign_citation":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7/action/citation_signature","submit_replication":"https://pith.science/pith/CEMHYS3UYKN6ISZTT547UUG7F7/action/replication_record"}},"created_at":"2026-07-05T07:41:36.512279+00:00","updated_at":"2026-07-05T07:41:36.512279+00:00"}