{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BR47DACZBQ46ATMGGRTUNOE6TU","short_pith_number":"pith:BR47DACZ","canonical_record":{"source":{"id":"1403.6637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-26T11:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"abacca8dd5b8c5f5ffa6c5f9195ef58bb1d99f2a2a72cdae9ba7eb40af6b5d96","abstract_canon_sha256":"42ca2f586084a5d0a4e3a3443ee4543f2f64261466be6f051ec6e2f0048cb776"},"schema_version":"1.0"},"canonical_sha256":"0c79f180590c39e04d86346746b89e9d3956801e7110166ab1a8278eb4b1a312","source":{"kind":"arxiv","id":"1403.6637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6637","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6637v2","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6637","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"BR47DACZBQ46","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BR47DACZBQ46ATMG","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BR47DACZ","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BR47DACZBQ46ATMGGRTUNOE6TU","target":"record","payload":{"canonical_record":{"source":{"id":"1403.6637","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-26T11:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"abacca8dd5b8c5f5ffa6c5f9195ef58bb1d99f2a2a72cdae9ba7eb40af6b5d96","abstract_canon_sha256":"42ca2f586084a5d0a4e3a3443ee4543f2f64261466be6f051ec6e2f0048cb776"},"schema_version":"1.0"},"canonical_sha256":"0c79f180590c39e04d86346746b89e9d3956801e7110166ab1a8278eb4b1a312","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:30.486990Z","signature_b64":"9XCus7KiHDTE/JGbMNLx1Zohc2t8rcf2askVdKNRipiNtjSJr17tfZHSDeuqgsFrjHzSZ8+1gUfUOhUSxH0rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c79f180590c39e04d86346746b89e9d3956801e7110166ab1a8278eb4b1a312","last_reissued_at":"2026-05-18T01:04:30.486368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:30.486368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.6637","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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TIwxHsLi6+Go8scR4PFdDWewfyOKEOHzpI8BrMoaRgvX0ZF69qzZJ+wDEPb43K9Q5djMbryCojW2WwaFKi6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:40:09.534966Z"},"content_sha256":"d601d4eeac878da011530deabfe1636762ced0b8f45b264b586eddd5858fb04c","schema_version":"1.0","event_id":"sha256:d601d4eeac878da011530deabfe1636762ced0b8f45b264b586eddd5858fb04c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BR47DACZBQ46ATMGGRTUNOE6TU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probably Approximately Symmetric: Fast rigid Symmetry Detection with Global Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alex Bronstein, Roee Litman, Shai Avidan, Simon Korman","submitted_at":"2014-03-26T11:53:07Z","abstract_excerpt":"We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high probability. Our method uses a carefully designed sampling of the transformation space, where each transformation is efficiently evaluated using a sub-linear algorithm. We prove that the density of the sampling depends on the total variation of the shape, allowing us to derive formal bounds on the algorithm's complexity and approximation quality. We further investig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6637","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:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05QG6UuZ0kdewVRqMaEFxuNZpQ3VRJc0fcOnreUznbtmMvYb5fbiCm0Z91YH34yDNPNxc1vmoU4JfWzq8wkuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:40:09.535310Z"},"content_sha256":"00ff581ba324c7738811a0a604fa7b9233f8d06b455998001a7364a94d35e09c","schema_version":"1.0","event_id":"sha256:00ff581ba324c7738811a0a604fa7b9233f8d06b455998001a7364a94d35e09c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BR47DACZBQ46ATMGGRTUNOE6TU/bundle.json","state_url":"https://pith.science/pith/BR47DACZBQ46ATMGGRTUNOE6TU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BR47DACZBQ46ATMGGRTUNOE6TU/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-01T04:40:09Z","links":{"resolver":"https://pith.science/pith/BR47DACZBQ46ATMGGRTUNOE6TU","bundle":"https://pith.science/pith/BR47DACZBQ46ATMGGRTUNOE6TU/bundle.json","state":"https://pith.science/pith/BR47DACZBQ46ATMGGRTUNOE6TU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BR47DACZBQ46ATMGGRTUNOE6TU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BR47DACZBQ46ATMGGRTUNOE6TU","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":"42ca2f586084a5d0a4e3a3443ee4543f2f64261466be6f051ec6e2f0048cb776","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-26T11:53:07Z","title_canon_sha256":"abacca8dd5b8c5f5ffa6c5f9195ef58bb1d99f2a2a72cdae9ba7eb40af6b5d96"},"schema_version":"1.0","source":{"id":"1403.6637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.6637","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"1403.6637v2","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6637","created_at":"2026-05-18T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"BR47DACZBQ46","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BR47DACZBQ46ATMG","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BR47DACZ","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:00ff581ba324c7738811a0a604fa7b9233f8d06b455998001a7364a94d35e09c","target":"graph","created_at":"2026-05-18T01:04:30Z","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":"We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high probability. Our method uses a carefully designed sampling of the transformation space, where each transformation is efficiently evaluated using a sub-linear algorithm. We prove that the density of the sampling depends on the total variation of the shape, allowing us to derive formal bounds on the algorithm's complexity and approximation quality. We further investig","authors_text":"Alex Bronstein, Roee Litman, Shai Avidan, Simon Korman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-26T11:53:07Z","title":"Probably Approximately Symmetric: Fast rigid Symmetry Detection with Global Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6637","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:d601d4eeac878da011530deabfe1636762ced0b8f45b264b586eddd5858fb04c","target":"record","created_at":"2026-05-18T01:04:30Z","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":"42ca2f586084a5d0a4e3a3443ee4543f2f64261466be6f051ec6e2f0048cb776","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-26T11:53:07Z","title_canon_sha256":"abacca8dd5b8c5f5ffa6c5f9195ef58bb1d99f2a2a72cdae9ba7eb40af6b5d96"},"schema_version":"1.0","source":{"id":"1403.6637","kind":"arxiv","version":2}},"canonical_sha256":"0c79f180590c39e04d86346746b89e9d3956801e7110166ab1a8278eb4b1a312","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c79f180590c39e04d86346746b89e9d3956801e7110166ab1a8278eb4b1a312","first_computed_at":"2026-05-18T01:04:30.486368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:30.486368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9XCus7KiHDTE/JGbMNLx1Zohc2t8rcf2askVdKNRipiNtjSJr17tfZHSDeuqgsFrjHzSZ8+1gUfUOhUSxH0rDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:30.486990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.6637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d601d4eeac878da011530deabfe1636762ced0b8f45b264b586eddd5858fb04c","sha256:00ff581ba324c7738811a0a604fa7b9233f8d06b455998001a7364a94d35e09c"],"state_sha256":"d3ab7c01d2165e4c1b44a86c3744bdf1959e812a049dd613b5cc2bd2b154220c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"936NifjzNXgNPc4ve/Y9+3c/Lxe00hbzx1OoSN4x7pvKm3M1h0GTj/UmUIvT7wV9295QZhUNATk0ujX027l2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:40:09.537234Z","bundle_sha256":"0444d1268443213bac35a480b174be62592e6f093f4738d251ee344b083e3cb5"}}