{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PDCX3E2QA4HRMFQG7FD2RGHX7T","short_pith_number":"pith:PDCX3E2Q","canonical_record":{"source":{"id":"1611.07571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-22T22:46:17Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"bb8764cc8ac7b425139ebb2ebfad500b273a5cb40fee99e15fdf93a930a241d7","abstract_canon_sha256":"cdd96c75f39a10bbd725b42a2d861c853014b36649cfe9a2405168329e6bfd03"},"schema_version":"1.0"},"canonical_sha256":"78c57d9350070f161606f947a898f7fcd5cab6c9b4eac25c13c727bc4d388cb6","source":{"kind":"arxiv","id":"1611.07571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07571","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07571v2","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07571","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"PDCX3E2QA4HR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PDCX3E2QA4HRMFQG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PDCX3E2Q","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PDCX3E2QA4HRMFQG7FD2RGHX7T","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-22T22:46:17Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"bb8764cc8ac7b425139ebb2ebfad500b273a5cb40fee99e15fdf93a930a241d7","abstract_canon_sha256":"cdd96c75f39a10bbd725b42a2d861c853014b36649cfe9a2405168329e6bfd03"},"schema_version":"1.0"},"canonical_sha256":"78c57d9350070f161606f947a898f7fcd5cab6c9b4eac25c13c727bc4d388cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:38.848069Z","signature_b64":"8dlv14qCtj3RQfK+JhrOLFM2w5mEadD74SeM278f+JJPj7LNvAKk0a2mhTvsMIuWAf10aYH3iBlsuRYv05QpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c57d9350070f161606f947a898f7fcd5cab6c9b4eac25c13c727bc4d388cb6","last_reissued_at":"2026-05-18T00:46:38.847367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:38.847367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07571","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-18T00:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Iu+TJEJLzLVLHmyZX35UcI8UsZwQsPWru147z3XKVijFjvwTq46j6HzrIE/4WbfNIE8X5Rs12neI5UwxM0KCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:21:19.151894Z"},"content_sha256":"f8fe57c39fd34ed284cbaf68d7524ce3ac7d5ee173d83dfd8c34856445dcaa1a","schema_version":"1.0","event_id":"sha256:f8fe57c39fd34ed284cbaf68d7524ce3ac7d5ee173d83dfd8c34856445dcaa1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PDCX3E2QA4HRMFQG7FD2RGHX7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quad-networks: unsupervised learning to rank for interest point detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Akihito Seki, Lubor Ladicky, Marc Pollefeys, Nikolay Savinov, Torsten Sattler","submitted_at":"2016-11-22T22:46:17Z","abstract_excerpt":"Several machine learning tasks require to represent the data using only a sparse set of interest points. An ideal detector is able to find the corresponding interest points even if the data undergo a transformation typical for a given domain. Since the task is of high practical interest in computer vision, many hand-crafted solutions were proposed. In this paper, we ask a fundamental question: can we learn such detectors from scratch? Since it is often unclear what points are \"interesting\", human labelling cannot be used to find a truly unbiased solution. Therefore, the task requires an unsupe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07571","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-18T00:46:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkPEPpZYFsSC8YKFXyOd2zmSsvzplLQQl2DgCxSRhlmv///juhiOftu+co20yt4Q0TDS7SoxwjdktD+lLXNxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:21:19.152239Z"},"content_sha256":"32b7f3578dfd11402daae38e59bec79c89a8f31f83228bf8553a7e5cc5540619","schema_version":"1.0","event_id":"sha256:32b7f3578dfd11402daae38e59bec79c89a8f31f83228bf8553a7e5cc5540619"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T/bundle.json","state_url":"https://pith.science/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T/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-01T16:21:19Z","links":{"resolver":"https://pith.science/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T","bundle":"https://pith.science/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T/bundle.json","state":"https://pith.science/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDCX3E2QA4HRMFQG7FD2RGHX7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PDCX3E2QA4HRMFQG7FD2RGHX7T","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":"cdd96c75f39a10bbd725b42a2d861c853014b36649cfe9a2405168329e6bfd03","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-22T22:46:17Z","title_canon_sha256":"bb8764cc8ac7b425139ebb2ebfad500b273a5cb40fee99e15fdf93a930a241d7"},"schema_version":"1.0","source":{"id":"1611.07571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07571","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07571v2","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07571","created_at":"2026-05-18T00:46:38Z"},{"alias_kind":"pith_short_12","alias_value":"PDCX3E2QA4HR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PDCX3E2QA4HRMFQG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PDCX3E2Q","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:32b7f3578dfd11402daae38e59bec79c89a8f31f83228bf8553a7e5cc5540619","target":"graph","created_at":"2026-05-18T00:46:38Z","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":"Several machine learning tasks require to represent the data using only a sparse set of interest points. An ideal detector is able to find the corresponding interest points even if the data undergo a transformation typical for a given domain. Since the task is of high practical interest in computer vision, many hand-crafted solutions were proposed. In this paper, we ask a fundamental question: can we learn such detectors from scratch? Since it is often unclear what points are \"interesting\", human labelling cannot be used to find a truly unbiased solution. Therefore, the task requires an unsupe","authors_text":"Akihito Seki, Lubor Ladicky, Marc Pollefeys, Nikolay Savinov, Torsten Sattler","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-22T22:46:17Z","title":"Quad-networks: unsupervised learning to rank for interest point detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07571","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:f8fe57c39fd34ed284cbaf68d7524ce3ac7d5ee173d83dfd8c34856445dcaa1a","target":"record","created_at":"2026-05-18T00:46:38Z","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":"cdd96c75f39a10bbd725b42a2d861c853014b36649cfe9a2405168329e6bfd03","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-22T22:46:17Z","title_canon_sha256":"bb8764cc8ac7b425139ebb2ebfad500b273a5cb40fee99e15fdf93a930a241d7"},"schema_version":"1.0","source":{"id":"1611.07571","kind":"arxiv","version":2}},"canonical_sha256":"78c57d9350070f161606f947a898f7fcd5cab6c9b4eac25c13c727bc4d388cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78c57d9350070f161606f947a898f7fcd5cab6c9b4eac25c13c727bc4d388cb6","first_computed_at":"2026-05-18T00:46:38.847367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:38.847367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dlv14qCtj3RQfK+JhrOLFM2w5mEadD74SeM278f+JJPj7LNvAKk0a2mhTvsMIuWAf10aYH3iBlsuRYv05QpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:38.848069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8fe57c39fd34ed284cbaf68d7524ce3ac7d5ee173d83dfd8c34856445dcaa1a","sha256:32b7f3578dfd11402daae38e59bec79c89a8f31f83228bf8553a7e5cc5540619"],"state_sha256":"e275f1c23f4a3fca9c4527baf52c556ac5e5fe3f92293fd97207ba09e4696460"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJrqvZaymiph/nCHbYOa86I18q/pKPz6h0rieJ57x+6cAifR2c7inyo0toZ6oJtNPFnezlHzIGaJ3+J1u5ylAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:21:19.154490Z","bundle_sha256":"eef05d928625f9284df1d05749639fca97e051b237b4240876d0e3f6d41fffd7"}}