{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IP24ONFCNMKLTP7PTV2CA2ATF2","short_pith_number":"pith:IP24ONFC","schema_version":"1.0","canonical_sha256":"43f5c734a26b14b9bfef9d742068132e86c062d4f21d14afdaabfd53c85b6742","source":{"kind":"arxiv","id":"2206.15478","version":4},"attestation_state":"computed","paper":{"title":"On the Learning and Learnability of Quasimetrics","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Phillip Isola, Tongzhou Wang","submitted_at":"2022-06-30T17:59:52Z","abstract_excerpt":"Our world is full of asymmetries. Gravity and wind can make reaching a place easier than coming back. Social artifacts such as genealogy charts and citation graphs are inherently directed. In reinforcement learning and control, optimal goal-reaching strategies are rarely reversible (symmetrical). Distance functions supported on these asymmetrical structures are called quasimetrics. Despite their common appearance, little research has been done on the learning of quasimetrics.\n  Our theoretical analysis reveals that a common class of learning algorithms, including unconstrained multilayer perce"},"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":"2206.15478","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-30T17:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"ce94bae75675dd959a1c9085b5722b027c93b5176c9bef5deb783c3f31fb9cf5","abstract_canon_sha256":"1d6e37f99e99f15cd57a6bd5b717fb53fe659aa4ca169ddb2de96c45abf16017"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:03.177489Z","signature_b64":"DtFviG+E67CgnRZo3yMKL2cO5uGU3f+hDRwV8BJOcc00bJgGoBg1VAbTbHlqBbtnEh7RCQMCmUSWcMbZr2LiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43f5c734a26b14b9bfef9d742068132e86c062d4f21d14afdaabfd53c85b6742","last_reissued_at":"2026-07-05T05:03:03.177064Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:03.177064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Learning and Learnability of Quasimetrics","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Phillip Isola, Tongzhou Wang","submitted_at":"2022-06-30T17:59:52Z","abstract_excerpt":"Our world is full of asymmetries. Gravity and wind can make reaching a place easier than coming back. Social artifacts such as genealogy charts and citation graphs are inherently directed. In reinforcement learning and control, optimal goal-reaching strategies are rarely reversible (symmetrical). Distance functions supported on these asymmetrical structures are called quasimetrics. Despite their common appearance, little research has been done on the learning of quasimetrics.\n  Our theoretical analysis reveals that a common class of learning algorithms, including unconstrained multilayer perce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.15478","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/2206.15478/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":"2206.15478","created_at":"2026-07-05T05:03:03.177118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.15478v4","created_at":"2026-07-05T05:03:03.177118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.15478","created_at":"2026-07-05T05:03:03.177118+00:00"},{"alias_kind":"pith_short_12","alias_value":"IP24ONFCNMKL","created_at":"2026-07-05T05:03:03.177118+00:00"},{"alias_kind":"pith_short_16","alias_value":"IP24ONFCNMKLTP7P","created_at":"2026-07-05T05:03:03.177118+00:00"},{"alias_kind":"pith_short_8","alias_value":"IP24ONFC","created_at":"2026-07-05T05:03:03.177118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2210.00030","citing_title":"VIP: Towards Universal Visual Reward and Representation via Value-Implicit Pre-Training","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2","json":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2.json","graph_json":"https://pith.science/api/pith-number/IP24ONFCNMKLTP7PTV2CA2ATF2/graph.json","events_json":"https://pith.science/api/pith-number/IP24ONFCNMKLTP7PTV2CA2ATF2/events.json","paper":"https://pith.science/paper/IP24ONFC"},"agent_actions":{"view_html":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2","download_json":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2.json","view_paper":"https://pith.science/paper/IP24ONFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.15478&json=true","fetch_graph":"https://pith.science/api/pith-number/IP24ONFCNMKLTP7PTV2CA2ATF2/graph.json","fetch_events":"https://pith.science/api/pith-number/IP24ONFCNMKLTP7PTV2CA2ATF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2/action/storage_attestation","attest_author":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2/action/author_attestation","sign_citation":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2/action/citation_signature","submit_replication":"https://pith.science/pith/IP24ONFCNMKLTP7PTV2CA2ATF2/action/replication_record"}},"created_at":"2026-07-05T05:03:03.177118+00:00","updated_at":"2026-07-05T05:03:03.177118+00:00"}