{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q46JSTVBXAOTAGQ523YWVWQKDN","short_pith_number":"pith:Q46JSTVB","schema_version":"1.0","canonical_sha256":"873c994ea1b81d301a1dd6f16ada0a1b4348930e9caf420c17c58ac74c5efcf1","source":{"kind":"arxiv","id":"2012.00123","version":2},"attestation_state":"computed","paper":{"title":"A Hypergradient Approach to Robust Regression without Correspondence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongteng Xu, Hongyuan Zha, Simiao Zuo, Tuo Zhao, Xiaojing Ye, Yixiu Mao, Yujia Xie","submitted_at":"2020-11-30T21:47:38Z","abstract_excerpt":"We consider a variant of regression problem, where the correspondence between input and output data is not available. Such shuffled data is commonly observed in many real world problems. Taking flow cytometry as an example, the measuring instruments may not be able to maintain the correspondence between the samples and the measurements. Due to the combinatorial nature of the problem, most existing methods are only applicable when the sample size is small, and limited to linear regression models. To overcome such bottlenecks, we propose a new computational framework -- ROBOT -- for the shuffled"},"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":"2012.00123","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-30T21:47:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dc6c27a967143125b729934ed4ca88d9a0712f3f96c1d4aa37c71a409799e041","abstract_canon_sha256":"93923f1aa88b58a77df42ce361a819d5aa5ef2dc5a25ef4a9f8e5a3f9a19c5fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:32.670265Z","signature_b64":"3YnClxP6YZ2T69zKxNPnzs45SsrwrFB8wkLFb/eihmwEefkSdvINQ8Vxr0Luw6dV2LiM4DmRA2bXfbv12cMkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"873c994ea1b81d301a1dd6f16ada0a1b4348930e9caf420c17c58ac74c5efcf1","last_reissued_at":"2026-07-05T02:14:32.669784Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:32.669784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hypergradient Approach to Robust Regression without Correspondence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Hongteng Xu, Hongyuan Zha, Simiao Zuo, Tuo Zhao, Xiaojing Ye, Yixiu Mao, Yujia Xie","submitted_at":"2020-11-30T21:47:38Z","abstract_excerpt":"We consider a variant of regression problem, where the correspondence between input and output data is not available. Such shuffled data is commonly observed in many real world problems. Taking flow cytometry as an example, the measuring instruments may not be able to maintain the correspondence between the samples and the measurements. Due to the combinatorial nature of the problem, most existing methods are only applicable when the sample size is small, and limited to linear regression models. To overcome such bottlenecks, we propose a new computational framework -- ROBOT -- for the shuffled"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00123","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/2012.00123/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":"2012.00123","created_at":"2026-07-05T02:14:32.669842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.00123v2","created_at":"2026-07-05T02:14:32.669842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00123","created_at":"2026-07-05T02:14:32.669842+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q46JSTVBXAOT","created_at":"2026-07-05T02:14:32.669842+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q46JSTVBXAOTAGQ5","created_at":"2026-07-05T02:14:32.669842+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q46JSTVB","created_at":"2026-07-05T02:14:32.669842+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.03067","citing_title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN","json":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN.json","graph_json":"https://pith.science/api/pith-number/Q46JSTVBXAOTAGQ523YWVWQKDN/graph.json","events_json":"https://pith.science/api/pith-number/Q46JSTVBXAOTAGQ523YWVWQKDN/events.json","paper":"https://pith.science/paper/Q46JSTVB"},"agent_actions":{"view_html":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN","download_json":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN.json","view_paper":"https://pith.science/paper/Q46JSTVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.00123&json=true","fetch_graph":"https://pith.science/api/pith-number/Q46JSTVBXAOTAGQ523YWVWQKDN/graph.json","fetch_events":"https://pith.science/api/pith-number/Q46JSTVBXAOTAGQ523YWVWQKDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN/action/storage_attestation","attest_author":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN/action/author_attestation","sign_citation":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN/action/citation_signature","submit_replication":"https://pith.science/pith/Q46JSTVBXAOTAGQ523YWVWQKDN/action/replication_record"}},"created_at":"2026-07-05T02:14:32.669842+00:00","updated_at":"2026-07-05T02:14:32.669842+00:00"}