{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GPZJSCFIJUCIA5AP7A7LRCIXQV","short_pith_number":"pith:GPZJSCFI","canonical_record":{"source":{"id":"1111.1713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"a7a5cf26824e7dec850322e1792cd5260fa7707229a0e02dc74312d94ff49540","abstract_canon_sha256":"4bf37064f9d20e0dad82a1cab2428fe0af2b2f303064ca2ad35ed691640a3ee2"},"schema_version":"1.0"},"canonical_sha256":"33f29908a84d0480740ff83eb88917856a43c694d94e8020ff927c78fe05019c","source":{"kind":"arxiv","id":"1111.1713","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1713","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1713v1","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1713","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"GPZJSCFIJUCI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPZJSCFIJUCIA5AP","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPZJSCFI","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GPZJSCFIJUCIA5AP7A7LRCIXQV","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1713","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"a7a5cf26824e7dec850322e1792cd5260fa7707229a0e02dc74312d94ff49540","abstract_canon_sha256":"4bf37064f9d20e0dad82a1cab2428fe0af2b2f303064ca2ad35ed691640a3ee2"},"schema_version":"1.0"},"canonical_sha256":"33f29908a84d0480740ff83eb88917856a43c694d94e8020ff927c78fe05019c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:24.825435Z","signature_b64":"yHlew1fwAHsHQPMI0uyq1O5T9eVU+utO7PCsBdqOgkPrI4a7lBkKxRuYSpUUC4W8d1ml87d80HdNkVA3xBxOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33f29908a84d0480740ff83eb88917856a43c694d94e8020ff927c78fe05019c","last_reissued_at":"2026-05-18T04:09:24.824693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:24.824693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1713","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-18T04:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o9IGohT76exf2oW1CBefQY9UMfthBuS6cqOESpJ6fIFOuAuofHKmlt+A+bcL5bx48Tc9xACr11VdOXLOM4WaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:52:05.729556Z"},"content_sha256":"9a6a0e3c9791b24c63bbafd3e6f24719b7fc53a5e44e45658e9646369a70afbf","schema_version":"1.0","event_id":"sha256:9a6a0e3c9791b24c63bbafd3e6f24719b7fc53a5e44e45658e9646369a70afbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GPZJSCFIJUCIA5AP7A7LRCIXQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Approximation of Image Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Reichman, Gilad Tsur, Simon Korman","submitted_at":"2011-11-07T18:37:42Z","abstract_excerpt":"In this work we consider the {\\em image matching} problem for two grayscale $n \\times n$ images, $M_1$ and $M_2$ (where pixel values range from 0 to 1). Our goal is to find an affine transformation $T$ that maps pixels from $M_1$ to pixels in $M_2$ so that the differences over pixels $p$ between $M_1(p)$ and $M_2(T(p))$ is minimized. Our focus here is on sublinear algorithms that give an approximate result for this problem, that is, we wish to perform this task while querying as few pixels from both images as possible, and give a transformation that comes close to minimizing the difference.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1713","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-18T04:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLaseGBkoysx002fIz+EVnVeffpoSMv0lZw3Omul9LQ2XD7cbI2dSFhWFFw/DVVz/r5kCdi1uRsq7575R1BlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:52:05.730108Z"},"content_sha256":"bab930b4dc55e847939ba6c858c02d887d457aec4e54b53caaa1ba7f888ab506","schema_version":"1.0","event_id":"sha256:bab930b4dc55e847939ba6c858c02d887d457aec4e54b53caaa1ba7f888ab506"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV/bundle.json","state_url":"https://pith.science/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV/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-30T03:52:05Z","links":{"resolver":"https://pith.science/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV","bundle":"https://pith.science/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV/bundle.json","state":"https://pith.science/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPZJSCFIJUCIA5AP7A7LRCIXQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GPZJSCFIJUCIA5AP7A7LRCIXQV","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":"4bf37064f9d20e0dad82a1cab2428fe0af2b2f303064ca2ad35ed691640a3ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:42Z","title_canon_sha256":"a7a5cf26824e7dec850322e1792cd5260fa7707229a0e02dc74312d94ff49540"},"schema_version":"1.0","source":{"id":"1111.1713","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1713","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1713v1","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1713","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"GPZJSCFIJUCI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPZJSCFIJUCIA5AP","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPZJSCFI","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:bab930b4dc55e847939ba6c858c02d887d457aec4e54b53caaa1ba7f888ab506","target":"graph","created_at":"2026-05-18T04:09:24Z","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 consider the {\\em image matching} problem for two grayscale $n \\times n$ images, $M_1$ and $M_2$ (where pixel values range from 0 to 1). Our goal is to find an affine transformation $T$ that maps pixels from $M_1$ to pixels in $M_2$ so that the differences over pixels $p$ between $M_1(p)$ and $M_2(T(p))$ is minimized. Our focus here is on sublinear algorithms that give an approximate result for this problem, that is, we wish to perform this task while querying as few pixels from both images as possible, and give a transformation that comes close to minimizing the difference.\n  ","authors_text":"Daniel Reichman, Gilad Tsur, Simon Korman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:42Z","title":"Tight Approximation of Image Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1713","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:9a6a0e3c9791b24c63bbafd3e6f24719b7fc53a5e44e45658e9646369a70afbf","target":"record","created_at":"2026-05-18T04:09:24Z","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":"4bf37064f9d20e0dad82a1cab2428fe0af2b2f303064ca2ad35ed691640a3ee2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T18:37:42Z","title_canon_sha256":"a7a5cf26824e7dec850322e1792cd5260fa7707229a0e02dc74312d94ff49540"},"schema_version":"1.0","source":{"id":"1111.1713","kind":"arxiv","version":1}},"canonical_sha256":"33f29908a84d0480740ff83eb88917856a43c694d94e8020ff927c78fe05019c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33f29908a84d0480740ff83eb88917856a43c694d94e8020ff927c78fe05019c","first_computed_at":"2026-05-18T04:09:24.824693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:24.824693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yHlew1fwAHsHQPMI0uyq1O5T9eVU+utO7PCsBdqOgkPrI4a7lBkKxRuYSpUUC4W8d1ml87d80HdNkVA3xBxOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:24.825435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1713","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a6a0e3c9791b24c63bbafd3e6f24719b7fc53a5e44e45658e9646369a70afbf","sha256:bab930b4dc55e847939ba6c858c02d887d457aec4e54b53caaa1ba7f888ab506"],"state_sha256":"66e7135fe8969c884adc17377b73daa1c09db0f1f321ab48dd0b17b3787de88d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FY41RBISFbIVGro4H4mJ7noI9aAqMIJ70bdogKBBqKcpNUHpJ0qZwdRk1/ONlu+nNqSdKs/o9H4AV7diQ7klAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:52:05.733113Z","bundle_sha256":"3af5662b4a66171226b4417f4a45f719914933b1139b72bb16742a06504b189d"}}