{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WPQHT6RL27A2MPCONGCQ4QF62T","short_pith_number":"pith:WPQHT6RL","schema_version":"1.0","canonical_sha256":"b3e079fa2bd7c1a63c4e69850e40bed4c738e44e820deaa41e4ecc6e16673b18","source":{"kind":"arxiv","id":"1606.03731","version":1},"attestation_state":"computed","paper":{"title":"A constrained clustering based approach for matching a collection of feature sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongyuan Zha, Junchi Yan, Stephen Chu, Zhe Ren","submitted_at":"2016-06-12T15:40:30Z","abstract_excerpt":"In this paper, we consider the problem of finding the feature correspondences among a collection of feature sets, by using their point-wise unary features. This is a fundamental problem in computer vision and pattern recognition, which also closely relates to other areas such as operational research. Different from two-set matching which can be transformed to a quadratic assignment programming task that is known NP-hard, inclusion of merely unary attributes leads to a linear assignment problem for matching two feature sets. This problem has been well studied and there are effective polynomial "},"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":"1606.03731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-12T15:40:30Z","cross_cats_sorted":[],"title_canon_sha256":"1acc3a174e17b7727fd80b6fc62c4abeca66d5af47b1b3341309f8631ac44348","abstract_canon_sha256":"7dcf0c549e71bfcec9d9490f42d5fc3b3b0647eff28e26c82f442a949457e0fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:33.201463Z","signature_b64":"oUBMoRZcPt9MYJgeLwDL0LHTwK0w1jhBONlQzf46G7wZJj2KmOnPqtoVy6N7kHrYzLsX8QZCR1q2OXo7HzC2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3e079fa2bd7c1a63c4e69850e40bed4c738e44e820deaa41e4ecc6e16673b18","last_reissued_at":"2026-05-18T01:12:33.201000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:33.201000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A constrained clustering based approach for matching a collection of feature sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongyuan Zha, Junchi Yan, Stephen Chu, Zhe Ren","submitted_at":"2016-06-12T15:40:30Z","abstract_excerpt":"In this paper, we consider the problem of finding the feature correspondences among a collection of feature sets, by using their point-wise unary features. This is a fundamental problem in computer vision and pattern recognition, which also closely relates to other areas such as operational research. Different from two-set matching which can be transformed to a quadratic assignment programming task that is known NP-hard, inclusion of merely unary attributes leads to a linear assignment problem for matching two feature sets. This problem has been well studied and there are effective polynomial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03731","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":""},"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":"1606.03731","created_at":"2026-05-18T01:12:33.201084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03731v1","created_at":"2026-05-18T01:12:33.201084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03731","created_at":"2026-05-18T01:12:33.201084+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPQHT6RL27A2","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPQHT6RL27A2MPCO","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPQHT6RL","created_at":"2026-05-18T12:30:51.357362+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/WPQHT6RL27A2MPCONGCQ4QF62T","json":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T.json","graph_json":"https://pith.science/api/pith-number/WPQHT6RL27A2MPCONGCQ4QF62T/graph.json","events_json":"https://pith.science/api/pith-number/WPQHT6RL27A2MPCONGCQ4QF62T/events.json","paper":"https://pith.science/paper/WPQHT6RL"},"agent_actions":{"view_html":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T","download_json":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T.json","view_paper":"https://pith.science/paper/WPQHT6RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03731&json=true","fetch_graph":"https://pith.science/api/pith-number/WPQHT6RL27A2MPCONGCQ4QF62T/graph.json","fetch_events":"https://pith.science/api/pith-number/WPQHT6RL27A2MPCONGCQ4QF62T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/action/storage_attestation","attest_author":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/action/author_attestation","sign_citation":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/action/citation_signature","submit_replication":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/action/replication_record"}},"created_at":"2026-05-18T01:12:33.201084+00:00","updated_at":"2026-05-18T01:12:33.201084+00:00"}