{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WPQHT6RL27A2MPCONGCQ4QF62T","short_pith_number":"pith:WPQHT6RL","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"},"canonical_sha256":"b3e079fa2bd7c1a63c4e69850e40bed4c738e44e820deaa41e4ecc6e16673b18","source":{"kind":"arxiv","id":"1606.03731","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03731","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03731v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03731","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"WPQHT6RL27A2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WPQHT6RL27A2MPCO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WPQHT6RL","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WPQHT6RL27A2MPCONGCQ4QF62T","target":"record","payload":{"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"},"canonical_sha256":"b3e079fa2bd7c1a63c4e69850e40bed4c738e44e820deaa41e4ecc6e16673b18","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"},"source_kind":"arxiv","source_id":"1606.03731","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDCl6D5a9wCrsKJsrvgud0rD8KyZDoNJNuvjKQvqVfeFL9+8eEfwwyVI483Y2c7RAxiZaLq8Inn30+MljBjjCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:40:37.905872Z"},"content_sha256":"169cfdbdf4b159c105b5381d419f780551fde4b066f46c7ca3db2589dad1ca56","schema_version":"1.0","event_id":"sha256:169cfdbdf4b159c105b5381d419f780551fde4b066f46c7ca3db2589dad1ca56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WPQHT6RL27A2MPCONGCQ4QF62T","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xpOHb4tQzFiAmKh9YUWUArxyt8rIjEpDDeebuxZ0L/15y19n/jXzS0i7RI5QWnaG7kq+w5CgWpVbfEaJ5QGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T02:40:37.906230Z"},"content_sha256":"3ebbb27c79f57b8269b2e5d6a7ebf2ea560a0447d8aaa48d4fac697533d1ade5","schema_version":"1.0","event_id":"sha256:3ebbb27c79f57b8269b2e5d6a7ebf2ea560a0447d8aaa48d4fac697533d1ade5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/bundle.json","state_url":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPQHT6RL27A2MPCONGCQ4QF62T/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T02:40:37Z","links":{"resolver":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T","bundle":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/bundle.json","state":"https://pith.science/pith/WPQHT6RL27A2MPCONGCQ4QF62T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPQHT6RL27A2MPCONGCQ4QF62T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WPQHT6RL27A2MPCONGCQ4QF62T","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7dcf0c549e71bfcec9d9490f42d5fc3b3b0647eff28e26c82f442a949457e0fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-12T15:40:30Z","title_canon_sha256":"1acc3a174e17b7727fd80b6fc62c4abeca66d5af47b1b3341309f8631ac44348"},"schema_version":"1.0","source":{"id":"1606.03731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.03731","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1606.03731v1","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03731","created_at":"2026-05-18T01:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"WPQHT6RL27A2","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WPQHT6RL27A2MPCO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WPQHT6RL","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:3ebbb27c79f57b8269b2e5d6a7ebf2ea560a0447d8aaa48d4fac697533d1ade5","target":"graph","created_at":"2026-05-18T01:12:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Hongyuan Zha, Junchi Yan, Stephen Chu, Zhe Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-12T15:40:30Z","title":"A constrained clustering based approach for matching a collection of feature sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03731","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:169cfdbdf4b159c105b5381d419f780551fde4b066f46c7ca3db2589dad1ca56","target":"record","created_at":"2026-05-18T01:12:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7dcf0c549e71bfcec9d9490f42d5fc3b3b0647eff28e26c82f442a949457e0fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-06-12T15:40:30Z","title_canon_sha256":"1acc3a174e17b7727fd80b6fc62c4abeca66d5af47b1b3341309f8631ac44348"},"schema_version":"1.0","source":{"id":"1606.03731","kind":"arxiv","version":1}},"canonical_sha256":"b3e079fa2bd7c1a63c4e69850e40bed4c738e44e820deaa41e4ecc6e16673b18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3e079fa2bd7c1a63c4e69850e40bed4c738e44e820deaa41e4ecc6e16673b18","first_computed_at":"2026-05-18T01:12:33.201000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:33.201000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oUBMoRZcPt9MYJgeLwDL0LHTwK0w1jhBONlQzf46G7wZJj2KmOnPqtoVy6N7kHrYzLsX8QZCR1q2OXo7HzC2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:33.201463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.03731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:169cfdbdf4b159c105b5381d419f780551fde4b066f46c7ca3db2589dad1ca56","sha256:3ebbb27c79f57b8269b2e5d6a7ebf2ea560a0447d8aaa48d4fac697533d1ade5"],"state_sha256":"ee9174db722441bd81ea77ec7ead3b90769667622dea3e03b4fac55623d92764"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+BANDS9/YN0c6g0tHEMxBOqf+BEpn0clP0xIvm6vNNT5ILKTiul3tJHqwm3qWqtlgDx1E3U9oyAIlFTzXnZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T02:40:37.908443Z","bundle_sha256":"a829186ed9371e56e512628f92b92cad2acfadea27317bf1c48d1e3a31aefa66"}}