{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4DQ7JLSPDE3SK4K4UIL4NO5NKW","short_pith_number":"pith:4DQ7JLSP","schema_version":"1.0","canonical_sha256":"e0e1f4ae4f193725715ca217c6bbad55b5650a8cb0679eb823a58593e41d123c","source":{"kind":"arxiv","id":"2003.13253","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Geometry Compression using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV"],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Markus Friedrich, Sebastian Feld","submitted_at":"2020-03-30T07:56:34Z","abstract_excerpt":"The compression of geometry data is an important aspect of bandwidth-efficient data transfer for distributed 3d computer vision applications. We propose a quantum-enabled lossy 3d point cloud compression pipeline based on the constructive solid geometry (CSG) model representation. Key parts of the pipeline are mapped to NP-complete problems for which an efficient Ising formulation suitable for the execution on a Quantum Annealer exists. We describe existing Ising formulations for the maximum clique search problem and the smallest exact cover problem, both of which are important building blocks"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2003.13253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-30T07:56:34Z","cross_cats_sorted":["cs.CG","cs.CV"],"title_canon_sha256":"64373d1607675d21334d55d772e07fd0df3667607c926c4e0a5580189a941c1d","abstract_canon_sha256":"e1ab5b746e04fc426ff174b4737642185848d7704520b9bd8eb1fb029f5c24ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:13.871763Z","signature_b64":"S2uajN7ehOumKP3kZjzzXfMTljcP0fsx48M2SjA6trw7ag0LZ16qDjaRgv1k/N6kNCoEkERBcL84nrg3vOfWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0e1f4ae4f193725715ca217c6bbad55b5650a8cb0679eb823a58593e41d123c","last_reissued_at":"2026-07-05T00:51:13.871390Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:13.871390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Geometry Compression using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV"],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Markus Friedrich, Sebastian Feld","submitted_at":"2020-03-30T07:56:34Z","abstract_excerpt":"The compression of geometry data is an important aspect of bandwidth-efficient data transfer for distributed 3d computer vision applications. We propose a quantum-enabled lossy 3d point cloud compression pipeline based on the constructive solid geometry (CSG) model representation. Key parts of the pipeline are mapped to NP-complete problems for which an efficient Ising formulation suitable for the execution on a Quantum Annealer exists. We describe existing Ising formulations for the maximum clique search problem and the smallest exact cover problem, both of which are important building blocks"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13253","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/2003.13253/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2003.13253","created_at":"2026-07-05T00:51:13.871459+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.13253v1","created_at":"2026-07-05T00:51:13.871459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13253","created_at":"2026-07-05T00:51:13.871459+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DQ7JLSPDE3S","created_at":"2026-07-05T00:51:13.871459+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DQ7JLSPDE3SK4K4","created_at":"2026-07-05T00:51:13.871459+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DQ7JLSP","created_at":"2026-07-05T00:51:13.871459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW","json":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW.json","graph_json":"https://pith.science/api/pith-number/4DQ7JLSPDE3SK4K4UIL4NO5NKW/graph.json","events_json":"https://pith.science/api/pith-number/4DQ7JLSPDE3SK4K4UIL4NO5NKW/events.json","paper":"https://pith.science/paper/4DQ7JLSP"},"agent_actions":{"view_html":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW","download_json":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW.json","view_paper":"https://pith.science/paper/4DQ7JLSP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.13253&json=true","fetch_graph":"https://pith.science/api/pith-number/4DQ7JLSPDE3SK4K4UIL4NO5NKW/graph.json","fetch_events":"https://pith.science/api/pith-number/4DQ7JLSPDE3SK4K4UIL4NO5NKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW/action/storage_attestation","attest_author":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW/action/author_attestation","sign_citation":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW/action/citation_signature","submit_replication":"https://pith.science/pith/4DQ7JLSPDE3SK4K4UIL4NO5NKW/action/replication_record"}},"created_at":"2026-07-05T00:51:13.871459+00:00","updated_at":"2026-07-05T00:51:13.871459+00:00"}