{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7HYOJB3XZLG3NQ22GW2R4PQ25N","short_pith_number":"pith:7HYOJB3X","schema_version":"1.0","canonical_sha256":"f9f0e48777cacdb6c35a35b51e3e1aeb7fc6540d5694537d84fe585e2bacc80c","source":{"kind":"arxiv","id":"2011.14563","version":1},"attestation_state":"computed","paper":{"title":"Learnable Motion Coherence for Correspondence Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cheng Lin, Lingjie Liu, Wenping Wang, Yuan Liu, Zhen Dong","submitted_at":"2020-11-30T05:57:25Z","abstract_excerpt":"Motion coherence is an important clue for distinguishing true correspondences from false ones. Modeling motion coherence on sparse putative correspondences is challenging due to their sparsity and uneven distributions. Existing works on motion coherence are sensitive to parameter settings and have difficulty in dealing with complex motion patterns. In this paper, we introduce a network called Laplacian Motion Coherence Network (LMCNet) to learn motion coherence property for correspondence pruning. We propose a novel formulation of fitting coherent motions with a smooth function on a graph of c"},"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":"2011.14563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-30T05:57:25Z","cross_cats_sorted":[],"title_canon_sha256":"85e4feab2680bb863a8bed346157747b81b5ebfa00f9061f6d3576c9eebb6533","abstract_canon_sha256":"9ff56c7000ab15489aa75d24518fd39b976eee4749929e2eb32bbe2227f9ee13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:21.430248Z","signature_b64":"M4rIqeh567wJjiABD1Hh1iMCG4Cp+udAnsSWgUjy6q6rYdDomrhAeWRFYWFz5Laywx/ePb28uhd8ViLwI38mCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9f0e48777cacdb6c35a35b51e3e1aeb7fc6540d5694537d84fe585e2bacc80c","last_reissued_at":"2026-07-05T01:55:21.429814Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:21.429814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learnable Motion Coherence for Correspondence Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cheng Lin, Lingjie Liu, Wenping Wang, Yuan Liu, Zhen Dong","submitted_at":"2020-11-30T05:57:25Z","abstract_excerpt":"Motion coherence is an important clue for distinguishing true correspondences from false ones. Modeling motion coherence on sparse putative correspondences is challenging due to their sparsity and uneven distributions. Existing works on motion coherence are sensitive to parameter settings and have difficulty in dealing with complex motion patterns. In this paper, we introduce a network called Laplacian Motion Coherence Network (LMCNet) to learn motion coherence property for correspondence pruning. We propose a novel formulation of fitting coherent motions with a smooth function on a graph of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14563","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.14563/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":"2011.14563","created_at":"2026-07-05T01:55:21.429882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.14563v1","created_at":"2026-07-05T01:55:21.429882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14563","created_at":"2026-07-05T01:55:21.429882+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HYOJB3XZLG3","created_at":"2026-07-05T01:55:21.429882+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HYOJB3XZLG3NQ22","created_at":"2026-07-05T01:55:21.429882+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HYOJB3X","created_at":"2026-07-05T01:55:21.429882+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/7HYOJB3XZLG3NQ22GW2R4PQ25N","json":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N.json","graph_json":"https://pith.science/api/pith-number/7HYOJB3XZLG3NQ22GW2R4PQ25N/graph.json","events_json":"https://pith.science/api/pith-number/7HYOJB3XZLG3NQ22GW2R4PQ25N/events.json","paper":"https://pith.science/paper/7HYOJB3X"},"agent_actions":{"view_html":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N","download_json":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N.json","view_paper":"https://pith.science/paper/7HYOJB3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.14563&json=true","fetch_graph":"https://pith.science/api/pith-number/7HYOJB3XZLG3NQ22GW2R4PQ25N/graph.json","fetch_events":"https://pith.science/api/pith-number/7HYOJB3XZLG3NQ22GW2R4PQ25N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N/action/storage_attestation","attest_author":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N/action/author_attestation","sign_citation":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N/action/citation_signature","submit_replication":"https://pith.science/pith/7HYOJB3XZLG3NQ22GW2R4PQ25N/action/replication_record"}},"created_at":"2026-07-05T01:55:21.429882+00:00","updated_at":"2026-07-05T01:55:21.429882+00:00"}