{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NEHIBVMRPFFNQYML7H2YR7PJIB","short_pith_number":"pith:NEHIBVMR","schema_version":"1.0","canonical_sha256":"690e80d591794ad8618bf9f588fde940616a01fa9e11e4a23ff4b529f57f7aa3","source":{"kind":"arxiv","id":"2508.01733","version":2},"attestation_state":"computed","paper":{"title":"Topolow: Force-Directed Euclidean Embedding of Dissimilarity Data with Robustness Against Non-Metricity and Sparsity","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CG","authors_text":"Omid Arhami, Pejman Rohani","submitted_at":"2025-08-03T12:19:17Z","abstract_excerpt":"The problem of embedding a set of objects into a low-dimensional Euclidean space based on a matrix of pairwise dissimilarities is fundamental in data analysis, machine learning, and statistics. However, the assumptions of many standard analytical methods are violated when the input dissimilarities fail to satisfy metric or Euclidean axioms. We present the mathematical and statistical foundations of Topolow, a physics-inspired, gradient-free optimization framework for such embedding problems. Topolow is conceptually related to force-directed graph drawing algorithms but is fundamentally disting"},"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":"2508.01733","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CG","submitted_at":"2025-08-03T12:19:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"664571b78aa9f1454727d400fca7db0c045f369e076f6da1169417ffd478461a","abstract_canon_sha256":"a455b251c0218474f8971aeef136f5fd4d3bb63f2c0db7c1642a95cffd87760d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:21.939119Z","signature_b64":"tHTjHMW/hC7d1NrJLyghxsh41xbPIzI0I4wvrrIXctQp6A+qKBFlz2HHwKRnVFMwHWTbqEWdQ30WKe2UlUXqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690e80d591794ad8618bf9f588fde940616a01fa9e11e4a23ff4b529f57f7aa3","last_reissued_at":"2026-07-05T11:56:21.938703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:21.938703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topolow: Force-Directed Euclidean Embedding of Dissimilarity Data with Robustness Against Non-Metricity and Sparsity","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CG","authors_text":"Omid Arhami, Pejman Rohani","submitted_at":"2025-08-03T12:19:17Z","abstract_excerpt":"The problem of embedding a set of objects into a low-dimensional Euclidean space based on a matrix of pairwise dissimilarities is fundamental in data analysis, machine learning, and statistics. However, the assumptions of many standard analytical methods are violated when the input dissimilarities fail to satisfy metric or Euclidean axioms. We present the mathematical and statistical foundations of Topolow, a physics-inspired, gradient-free optimization framework for such embedding problems. Topolow is conceptually related to force-directed graph drawing algorithms but is fundamentally disting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.01733","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.01733/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":"2508.01733","created_at":"2026-07-05T11:56:21.938759+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.01733v2","created_at":"2026-07-05T11:56:21.938759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.01733","created_at":"2026-07-05T11:56:21.938759+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEHIBVMRPFFN","created_at":"2026-07-05T11:56:21.938759+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEHIBVMRPFFNQYML","created_at":"2026-07-05T11:56:21.938759+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEHIBVMR","created_at":"2026-07-05T11:56:21.938759+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/NEHIBVMRPFFNQYML7H2YR7PJIB","json":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB.json","graph_json":"https://pith.science/api/pith-number/NEHIBVMRPFFNQYML7H2YR7PJIB/graph.json","events_json":"https://pith.science/api/pith-number/NEHIBVMRPFFNQYML7H2YR7PJIB/events.json","paper":"https://pith.science/paper/NEHIBVMR"},"agent_actions":{"view_html":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB","download_json":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB.json","view_paper":"https://pith.science/paper/NEHIBVMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.01733&json=true","fetch_graph":"https://pith.science/api/pith-number/NEHIBVMRPFFNQYML7H2YR7PJIB/graph.json","fetch_events":"https://pith.science/api/pith-number/NEHIBVMRPFFNQYML7H2YR7PJIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB/action/storage_attestation","attest_author":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB/action/author_attestation","sign_citation":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB/action/citation_signature","submit_replication":"https://pith.science/pith/NEHIBVMRPFFNQYML7H2YR7PJIB/action/replication_record"}},"created_at":"2026-07-05T11:56:21.938759+00:00","updated_at":"2026-07-05T11:56:21.938759+00:00"}