{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BJ274APSZI7SSETBKCTKOMXENX","short_pith_number":"pith:BJ274APS","canonical_record":{"source":{"id":"1601.07648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-28T05:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"e7708b895c2fa7b9694b76774888c355fa60b420b22a91dbd10797f35df3ffcb","abstract_canon_sha256":"4f5866edb4f762944a3ed8dd9549bd9947ad2478186788ad9c56c99f36b80103"},"schema_version":"1.0"},"canonical_sha256":"0a75fe01f2ca3f29126150a6a732e46dc4111bab77de0b7c9f16f39108016b9c","source":{"kind":"arxiv","id":"1601.07648","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07648","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07648v2","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07648","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"BJ274APSZI7S","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BJ274APSZI7SSETB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BJ274APS","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BJ274APSZI7SSETBKCTKOMXENX","target":"record","payload":{"canonical_record":{"source":{"id":"1601.07648","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-28T05:17:17Z","cross_cats_sorted":[],"title_canon_sha256":"e7708b895c2fa7b9694b76774888c355fa60b420b22a91dbd10797f35df3ffcb","abstract_canon_sha256":"4f5866edb4f762944a3ed8dd9549bd9947ad2478186788ad9c56c99f36b80103"},"schema_version":"1.0"},"canonical_sha256":"0a75fe01f2ca3f29126150a6a732e46dc4111bab77de0b7c9f16f39108016b9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.941031Z","signature_b64":"RuTwaWF+ASabLmaVH/LJLB1m4WzzQ2pxJ3NblO7GsqdTy0DDQ8MQ1ZS22aqibfMWZjmOiY7QEavzq4v4CbgZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a75fe01f2ca3f29126150a6a732e46dc4111bab77de0b7c9f16f39108016b9c","last_reissued_at":"2026-05-18T01:21:18.940381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.940381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.07648","source_version":2,"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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Fyz9fC+zIT0aLjpsTcCppOWc5W099yse/Lo1Yv/GuSTu/k+Z37Vc0MSIhCJ/oPC4RdFOLXNXmJOe1Nmtir+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:11:34.333741Z"},"content_sha256":"8a70cd380cb403849c97dc27919e9b4568ea56f4c01970da527b1b9eab119120","schema_version":"1.0","event_id":"sha256:8a70cd380cb403849c97dc27919e9b4568ea56f4c01970da527b1b9eab119120"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BJ274APSZI7SSETBKCTKOMXENX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Grassmannian Graph Approach to Affine Invariant Feature Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Adrian Peter, Anand Rangarajan, John Corring, Mark Moyou","submitted_at":"2016-01-28T05:17:17Z","abstract_excerpt":"In this work, we present a novel and practical approach to address one of the longstanding problems in computer vision: 2D and 3D affine invariant feature matching. Our Grassmannian Graph (GrassGraph) framework employs a two stage procedure that is capable of robustly recovering correspondences between two unorganized, affinely related feature (point) sets. The first stage maps the feature sets to an affine invariant Grassmannian representation, where the features are mapped into the same subspace. It turns out that coordinate representations extracted from the Grassmannian differ by an arbitr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07648","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":""},"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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwmC8ITHVg2nwnUIX/vB6jL5vcXCoLyup1H6Q5dQ8X4gHHnhguFlyxqE9rRTi8ayUG0nnaOvV3uVKS7yOQyHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:11:34.334079Z"},"content_sha256":"e9e023d6e556579c47ac92e16e37c862588b0ad6a1100184ad9051f94e268e1e","schema_version":"1.0","event_id":"sha256:e9e023d6e556579c47ac92e16e37c862588b0ad6a1100184ad9051f94e268e1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJ274APSZI7SSETBKCTKOMXENX/bundle.json","state_url":"https://pith.science/pith/BJ274APSZI7SSETBKCTKOMXENX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJ274APSZI7SSETBKCTKOMXENX/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-07-03T22:11:34Z","links":{"resolver":"https://pith.science/pith/BJ274APSZI7SSETBKCTKOMXENX","bundle":"https://pith.science/pith/BJ274APSZI7SSETBKCTKOMXENX/bundle.json","state":"https://pith.science/pith/BJ274APSZI7SSETBKCTKOMXENX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJ274APSZI7SSETBKCTKOMXENX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BJ274APSZI7SSETBKCTKOMXENX","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":"4f5866edb4f762944a3ed8dd9549bd9947ad2478186788ad9c56c99f36b80103","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-28T05:17:17Z","title_canon_sha256":"e7708b895c2fa7b9694b76774888c355fa60b420b22a91dbd10797f35df3ffcb"},"schema_version":"1.0","source":{"id":"1601.07648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07648","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07648v2","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07648","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"BJ274APSZI7S","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BJ274APSZI7SSETB","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BJ274APS","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:e9e023d6e556579c47ac92e16e37c862588b0ad6a1100184ad9051f94e268e1e","target":"graph","created_at":"2026-05-18T01:21:18Z","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 work, we present a novel and practical approach to address one of the longstanding problems in computer vision: 2D and 3D affine invariant feature matching. Our Grassmannian Graph (GrassGraph) framework employs a two stage procedure that is capable of robustly recovering correspondences between two unorganized, affinely related feature (point) sets. The first stage maps the feature sets to an affine invariant Grassmannian representation, where the features are mapped into the same subspace. It turns out that coordinate representations extracted from the Grassmannian differ by an arbitr","authors_text":"Adrian Peter, Anand Rangarajan, John Corring, Mark Moyou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-28T05:17:17Z","title":"A Grassmannian Graph Approach to Affine Invariant Feature Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07648","kind":"arxiv","version":2},"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:8a70cd380cb403849c97dc27919e9b4568ea56f4c01970da527b1b9eab119120","target":"record","created_at":"2026-05-18T01:21:18Z","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":"4f5866edb4f762944a3ed8dd9549bd9947ad2478186788ad9c56c99f36b80103","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-01-28T05:17:17Z","title_canon_sha256":"e7708b895c2fa7b9694b76774888c355fa60b420b22a91dbd10797f35df3ffcb"},"schema_version":"1.0","source":{"id":"1601.07648","kind":"arxiv","version":2}},"canonical_sha256":"0a75fe01f2ca3f29126150a6a732e46dc4111bab77de0b7c9f16f39108016b9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a75fe01f2ca3f29126150a6a732e46dc4111bab77de0b7c9f16f39108016b9c","first_computed_at":"2026-05-18T01:21:18.940381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.940381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RuTwaWF+ASabLmaVH/LJLB1m4WzzQ2pxJ3NblO7GsqdTy0DDQ8MQ1ZS22aqibfMWZjmOiY7QEavzq4v4CbgZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.941031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a70cd380cb403849c97dc27919e9b4568ea56f4c01970da527b1b9eab119120","sha256:e9e023d6e556579c47ac92e16e37c862588b0ad6a1100184ad9051f94e268e1e"],"state_sha256":"3211c29ec1d2b0fc82babd16316f422275f0b62f0bac5aeb38188a135fe99f8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITq5vNKt//rS4jJiY3TjNOi9u5Dtd/wuUDH7zfn4EPiD4TJeZfnZPv6xBpwjs5/ZMZHBZA0mMivJJFkCS09LBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:11:34.335941Z","bundle_sha256":"311ac054db41f6c3af242d8cbfac09aba09645a1b64313c5e3e13e452b31adc6"}}