{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YA563MDYKB7RH3KVPOAQAZ6OJG","short_pith_number":"pith:YA563MDY","canonical_record":{"source":{"id":"1811.12326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-29T17:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"c9a110239e464937a11d3183b1b379567509d31c2ee82a5523f965154dfdc2c4","abstract_canon_sha256":"9af119ce71a00d1f5351f42fcb98355ec28983265673d07615b4e06c01a864bc"},"schema_version":"1.0"},"canonical_sha256":"c03bedb078507f13ed557b810067ce499afb8046c1d2338b6a87a9c6928a60df","source":{"kind":"arxiv","id":"1811.12326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12326","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12326v1","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12326","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"YA563MDYKB7R","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YA563MDYKB7RH3KV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YA563MDY","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YA563MDYKB7RH3KVPOAQAZ6OJG","target":"record","payload":{"canonical_record":{"source":{"id":"1811.12326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-29T17:24:13Z","cross_cats_sorted":[],"title_canon_sha256":"c9a110239e464937a11d3183b1b379567509d31c2ee82a5523f965154dfdc2c4","abstract_canon_sha256":"9af119ce71a00d1f5351f42fcb98355ec28983265673d07615b4e06c01a864bc"},"schema_version":"1.0"},"canonical_sha256":"c03bedb078507f13ed557b810067ce499afb8046c1d2338b6a87a9c6928a60df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:33.769958Z","signature_b64":"WsY3Z9UqmfyTlXqBfzzQqqT60MkFGMQOicbBCPsY29KNBiYQYo8QGapio0KpCCnqDje8oYGduxwIfmtllIjWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c03bedb078507f13ed557b810067ce499afb8046c1d2338b6a87a9c6928a60df","last_reissued_at":"2026-05-17T23:59:33.769342Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:33.769342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.12326","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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyxOaWnxUuPT/ac+Rti0zEWwJ7tGTP5OK5lPGB33czQRwuRBIBOnuH0mPEaENJC8tGgSX0zSRSdiNUJqoYLFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:34:20.763723Z"},"content_sha256":"1da803de04affae8dadd2a3f63b2004e2f4aa97871260ac6e7846edf06822284","schema_version":"1.0","event_id":"sha256:1da803de04affae8dadd2a3f63b2004e2f4aa97871260ac6e7846edf06822284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YA563MDYKB7RH3KVPOAQAZ6OJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alireza Zaeemzadeh, Mohsen Joneidi, Mubarak Shah, Nazanin Rahnavard","submitted_at":"2018-11-29T17:24:13Z","abstract_excerpt":"The goal of data selection is to capture the most structural information from a set of data. This paper presents a fast and accurate data selection method, in which the selected samples are optimized to span the subspace of all data. We propose a new selection algorithm, referred to as iterative projection and matching (IPM), with linear complexity w.r.t. the number of data, and without any parameter to be tuned. In our algorithm, at each iteration, the maximum information from the structure of the data is captured by one selected sample, and the captured information is neglected in the next i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12326","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-17T23:59:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KM798b0ZLisGuZ/bJ71DNkpDA0PI5jPDb6rrXc417b1hCvNHnxstu+gVvZqmjsJk5tT/nvVoxiXxA5jX/4ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:34:20.764413Z"},"content_sha256":"f1c5b7ff724157d6f08c608b40d52f73e9b1f011251a7399119760cab0b6436c","schema_version":"1.0","event_id":"sha256:f1c5b7ff724157d6f08c608b40d52f73e9b1f011251a7399119760cab0b6436c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YA563MDYKB7RH3KVPOAQAZ6OJG/bundle.json","state_url":"https://pith.science/pith/YA563MDYKB7RH3KVPOAQAZ6OJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YA563MDYKB7RH3KVPOAQAZ6OJG/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-05-26T06:34:20Z","links":{"resolver":"https://pith.science/pith/YA563MDYKB7RH3KVPOAQAZ6OJG","bundle":"https://pith.science/pith/YA563MDYKB7RH3KVPOAQAZ6OJG/bundle.json","state":"https://pith.science/pith/YA563MDYKB7RH3KVPOAQAZ6OJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YA563MDYKB7RH3KVPOAQAZ6OJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YA563MDYKB7RH3KVPOAQAZ6OJG","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":"9af119ce71a00d1f5351f42fcb98355ec28983265673d07615b4e06c01a864bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-29T17:24:13Z","title_canon_sha256":"c9a110239e464937a11d3183b1b379567509d31c2ee82a5523f965154dfdc2c4"},"schema_version":"1.0","source":{"id":"1811.12326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.12326","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"arxiv_version","alias_value":"1811.12326v1","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12326","created_at":"2026-05-17T23:59:33Z"},{"alias_kind":"pith_short_12","alias_value":"YA563MDYKB7R","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YA563MDYKB7RH3KV","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YA563MDY","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:f1c5b7ff724157d6f08c608b40d52f73e9b1f011251a7399119760cab0b6436c","target":"graph","created_at":"2026-05-17T23:59: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":"The goal of data selection is to capture the most structural information from a set of data. This paper presents a fast and accurate data selection method, in which the selected samples are optimized to span the subspace of all data. We propose a new selection algorithm, referred to as iterative projection and matching (IPM), with linear complexity w.r.t. the number of data, and without any parameter to be tuned. In our algorithm, at each iteration, the maximum information from the structure of the data is captured by one selected sample, and the captured information is neglected in the next i","authors_text":"Alireza Zaeemzadeh, Mohsen Joneidi, Mubarak Shah, Nazanin Rahnavard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-29T17:24:13Z","title":"Iterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12326","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:1da803de04affae8dadd2a3f63b2004e2f4aa97871260ac6e7846edf06822284","target":"record","created_at":"2026-05-17T23:59: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":"9af119ce71a00d1f5351f42fcb98355ec28983265673d07615b4e06c01a864bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-29T17:24:13Z","title_canon_sha256":"c9a110239e464937a11d3183b1b379567509d31c2ee82a5523f965154dfdc2c4"},"schema_version":"1.0","source":{"id":"1811.12326","kind":"arxiv","version":1}},"canonical_sha256":"c03bedb078507f13ed557b810067ce499afb8046c1d2338b6a87a9c6928a60df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c03bedb078507f13ed557b810067ce499afb8046c1d2338b6a87a9c6928a60df","first_computed_at":"2026-05-17T23:59:33.769342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:33.769342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WsY3Z9UqmfyTlXqBfzzQqqT60MkFGMQOicbBCPsY29KNBiYQYo8QGapio0KpCCnqDje8oYGduxwIfmtllIjWBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:33.769958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.12326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1da803de04affae8dadd2a3f63b2004e2f4aa97871260ac6e7846edf06822284","sha256:f1c5b7ff724157d6f08c608b40d52f73e9b1f011251a7399119760cab0b6436c"],"state_sha256":"e8e48090e95d4d9981cb036da7ffa000caebde78ef807918960b9ded645f038c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYqQfGG0V8V446PtYvqjJaRFm0EQEe+DX+BILZX7ZFatPKVSll5UIpIFWDwjmXrZ5sNU4Tstb+HWrX5am4YtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:34:20.768128Z","bundle_sha256":"18284def6f503157f9033d6739bb2fb5e3b38c7cb657cf24f34e51272f6f1765"}}