{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:454F3CVZUSZMLEHJ6S7CNWPOTF","short_pith_number":"pith:454F3CVZ","canonical_record":{"source":{"id":"2311.12641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-11-21T14:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"508dc9741bc21e80e309f9c98e8b0efd3c997b83692ced75e8a2af2c6c0515be","abstract_canon_sha256":"924f3f81a047d261ce0250fdd6b1635f14c45139cb2f7be19893b751e098a936"},"schema_version":"1.0"},"canonical_sha256":"e7785d8ab9a4b2c590e9f4be26d9ee99570fddfcb62c07eed0f7af70fc18fc41","source":{"kind":"arxiv","id":"2311.12641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.12641","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2311.12641v1","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12641","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"454F3CVZUSZM","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"454F3CVZUSZMLEHJ","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"454F3CVZ","created_at":"2026-07-05T07:15:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:454F3CVZUSZMLEHJ6S7CNWPOTF","target":"record","payload":{"canonical_record":{"source":{"id":"2311.12641","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-11-21T14:41:21Z","cross_cats_sorted":[],"title_canon_sha256":"508dc9741bc21e80e309f9c98e8b0efd3c997b83692ced75e8a2af2c6c0515be","abstract_canon_sha256":"924f3f81a047d261ce0250fdd6b1635f14c45139cb2f7be19893b751e098a936"},"schema_version":"1.0"},"canonical_sha256":"e7785d8ab9a4b2c590e9f4be26d9ee99570fddfcb62c07eed0f7af70fc18fc41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:08.246715Z","signature_b64":"dRq2KHnSyX+86MR8ce8pexZEr67N8mp8ckNhdo8v37HAURQo1sdDsNOG/fwlPetCJVVxj8OPGJtMaE++cevEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7785d8ab9a4b2c590e9f4be26d9ee99570fddfcb62c07eed0f7af70fc18fc41","last_reissued_at":"2026-07-05T07:15:08.246265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:08.246265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.12641","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-07-05T07:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSz8tpr0zLiYWDdBkgAWGqPZl9Xbb76WTqzBsV3Cq4HTPW0sjUlYUIRUUtgjilpO64GdykKTXhi/QBf5K+eJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:47:24.786918Z"},"content_sha256":"6cc224fd1556c88016ba685efd2421a49f62034bec186bb16fdeb2f583101005","schema_version":"1.0","event_id":"sha256:6cc224fd1556c88016ba685efd2421a49f62034bec186bb16fdeb2f583101005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:454F3CVZUSZMLEHJ6S7CNWPOTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polyhedral Object Recognition by Indexing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Humberto Sossa, Radu Horaud","submitted_at":"2023-11-21T14:41:21Z","abstract_excerpt":"In computer vision, the indexing problem is the problem of recognizing a few objects in a large database of objects while avoiding the help of the classical image-feature-to-object-feature matching paradigm. In this paper we address the problem of recognizing 3-D polyhedral objects from 2-D images by indexing. Both the objects to be recognized and the images are represented by weighted graphs. The indexing problem is therefore the problem of determining whether a graph extracted from the image is present or absent in a database of model graphs. We introduce a novel method for performing this g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12641","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.12641/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hrp6zbY0gIoY2gt/SME7psjbN3MuyeRs1oc1DocT29redwSwH4mGcl6PkSWdoGyxj/Hhs72zhXwA2AfdiKnSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T16:47:24.787201Z"},"content_sha256":"a2cdcb2a24e4d3b2d4fbfdc53eea9a65763c8c781a2851f10b7062b55d9ff2aa","schema_version":"1.0","event_id":"sha256:a2cdcb2a24e4d3b2d4fbfdc53eea9a65763c8c781a2851f10b7062b55d9ff2aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/454F3CVZUSZMLEHJ6S7CNWPOTF/bundle.json","state_url":"https://pith.science/pith/454F3CVZUSZMLEHJ6S7CNWPOTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/454F3CVZUSZMLEHJ6S7CNWPOTF/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-31T16:47:24Z","links":{"resolver":"https://pith.science/pith/454F3CVZUSZMLEHJ6S7CNWPOTF","bundle":"https://pith.science/pith/454F3CVZUSZMLEHJ6S7CNWPOTF/bundle.json","state":"https://pith.science/pith/454F3CVZUSZMLEHJ6S7CNWPOTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/454F3CVZUSZMLEHJ6S7CNWPOTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:454F3CVZUSZMLEHJ6S7CNWPOTF","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":"924f3f81a047d261ce0250fdd6b1635f14c45139cb2f7be19893b751e098a936","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-11-21T14:41:21Z","title_canon_sha256":"508dc9741bc21e80e309f9c98e8b0efd3c997b83692ced75e8a2af2c6c0515be"},"schema_version":"1.0","source":{"id":"2311.12641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.12641","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2311.12641v1","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12641","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"454F3CVZUSZM","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"454F3CVZUSZMLEHJ","created_at":"2026-07-05T07:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"454F3CVZ","created_at":"2026-07-05T07:15:08Z"}],"graph_snapshots":[{"event_id":"sha256:a2cdcb2a24e4d3b2d4fbfdc53eea9a65763c8c781a2851f10b7062b55d9ff2aa","target":"graph","created_at":"2026-07-05T07:15:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.12641/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In computer vision, the indexing problem is the problem of recognizing a few objects in a large database of objects while avoiding the help of the classical image-feature-to-object-feature matching paradigm. In this paper we address the problem of recognizing 3-D polyhedral objects from 2-D images by indexing. Both the objects to be recognized and the images are represented by weighted graphs. The indexing problem is therefore the problem of determining whether a graph extracted from the image is present or absent in a database of model graphs. We introduce a novel method for performing this g","authors_text":"Humberto Sossa, Radu Horaud","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-11-21T14:41:21Z","title":"Polyhedral Object Recognition by Indexing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12641","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:6cc224fd1556c88016ba685efd2421a49f62034bec186bb16fdeb2f583101005","target":"record","created_at":"2026-07-05T07:15:08Z","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":"924f3f81a047d261ce0250fdd6b1635f14c45139cb2f7be19893b751e098a936","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-11-21T14:41:21Z","title_canon_sha256":"508dc9741bc21e80e309f9c98e8b0efd3c997b83692ced75e8a2af2c6c0515be"},"schema_version":"1.0","source":{"id":"2311.12641","kind":"arxiv","version":1}},"canonical_sha256":"e7785d8ab9a4b2c590e9f4be26d9ee99570fddfcb62c07eed0f7af70fc18fc41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7785d8ab9a4b2c590e9f4be26d9ee99570fddfcb62c07eed0f7af70fc18fc41","first_computed_at":"2026-07-05T07:15:08.246265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:15:08.246265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dRq2KHnSyX+86MR8ce8pexZEr67N8mp8ckNhdo8v37HAURQo1sdDsNOG/fwlPetCJVVxj8OPGJtMaE++cevEBg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:15:08.246715Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.12641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cc224fd1556c88016ba685efd2421a49f62034bec186bb16fdeb2f583101005","sha256:a2cdcb2a24e4d3b2d4fbfdc53eea9a65763c8c781a2851f10b7062b55d9ff2aa"],"state_sha256":"2eb9f36bb27c4156e7f57282509658ff3874505fe0532df0adc6e084411541a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YqlB/cOoLNazaLldL2weHmMMJLcA4zTupO99F+/fveEWZo5ek5Y1KNCSjtoEJclgF8WtIjtGWtUSo2+/gte/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T16:47:24.789438Z","bundle_sha256":"d762a90e1b75f939a5910eebdaa0f5c89a89cc17d83301f428b17102704e8811"}}