{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UVQYOKXLZDXCCFBSYFGD3XFZP2","short_pith_number":"pith:UVQYOKXL","schema_version":"1.0","canonical_sha256":"a561872aebc8ee211432c14c3ddcb97e9ed502815d195c8f70a4d7a316fbf3f0","source":{"kind":"arxiv","id":"2008.11476","version":1},"attestation_state":"computed","paper":{"title":"HipaccVX: Wedding of OpenVX and DSL-based Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PL"],"primary_cat":"cs.CV","authors_text":"Bo Qiao, Burak Ok, Frank Hannig, J\\\"urgen Teich, M. Akif \\\"Ozkan","submitted_at":"2020-08-26T10:30:18Z","abstract_excerpt":"Writing programs for heterogeneous platforms optimized for high performance is hard since this requires the code to be tuned at a low level with architecture-specific optimizations that are most times based on fundamentally differing programming paradigms and languages. OpenVX promises to solve this issue for computer vision applications with a royalty-free industry standard that is based on a graph-execution model. Yet, the OpenVX' algorithm space is constrained to a small set of vision functions. This hinders accelerating computations that are not included in the standard.\n  In this paper, w"},"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":"2008.11476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-26T10:30:18Z","cross_cats_sorted":["cs.DC","cs.PL"],"title_canon_sha256":"714c18fbc919cd7601deb74ae9799dda985aaed7ea8e1eb62e716f5bface2ce1","abstract_canon_sha256":"e02fdf3a510c5307365f4c820be76d298b5b169d3268d98f675bf7549657030a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:31:12.985633Z","signature_b64":"dKO+8plAQIMNmTsnPbFnW5xaNOhheF/Obs2/bylNd3VkX84r8ICVN1V3iFu0kqLDyuyqnRBcqa/NB25K4upCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a561872aebc8ee211432c14c3ddcb97e9ed502815d195c8f70a4d7a316fbf3f0","last_reissued_at":"2026-07-05T01:31:12.985233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:31:12.985233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HipaccVX: Wedding of OpenVX and DSL-based Code Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PL"],"primary_cat":"cs.CV","authors_text":"Bo Qiao, Burak Ok, Frank Hannig, J\\\"urgen Teich, M. Akif \\\"Ozkan","submitted_at":"2020-08-26T10:30:18Z","abstract_excerpt":"Writing programs for heterogeneous platforms optimized for high performance is hard since this requires the code to be tuned at a low level with architecture-specific optimizations that are most times based on fundamentally differing programming paradigms and languages. OpenVX promises to solve this issue for computer vision applications with a royalty-free industry standard that is based on a graph-execution model. Yet, the OpenVX' algorithm space is constrained to a small set of vision functions. This hinders accelerating computations that are not included in the standard.\n  In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.11476","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/2008.11476/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":"2008.11476","created_at":"2026-07-05T01:31:12.985289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.11476v1","created_at":"2026-07-05T01:31:12.985289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.11476","created_at":"2026-07-05T01:31:12.985289+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVQYOKXLZDXC","created_at":"2026-07-05T01:31:12.985289+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVQYOKXLZDXCCFBS","created_at":"2026-07-05T01:31:12.985289+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVQYOKXL","created_at":"2026-07-05T01:31:12.985289+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/UVQYOKXLZDXCCFBSYFGD3XFZP2","json":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2.json","graph_json":"https://pith.science/api/pith-number/UVQYOKXLZDXCCFBSYFGD3XFZP2/graph.json","events_json":"https://pith.science/api/pith-number/UVQYOKXLZDXCCFBSYFGD3XFZP2/events.json","paper":"https://pith.science/paper/UVQYOKXL"},"agent_actions":{"view_html":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2","download_json":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2.json","view_paper":"https://pith.science/paper/UVQYOKXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.11476&json=true","fetch_graph":"https://pith.science/api/pith-number/UVQYOKXLZDXCCFBSYFGD3XFZP2/graph.json","fetch_events":"https://pith.science/api/pith-number/UVQYOKXLZDXCCFBSYFGD3XFZP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2/action/storage_attestation","attest_author":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2/action/author_attestation","sign_citation":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2/action/citation_signature","submit_replication":"https://pith.science/pith/UVQYOKXLZDXCCFBSYFGD3XFZP2/action/replication_record"}},"created_at":"2026-07-05T01:31:12.985289+00:00","updated_at":"2026-07-05T01:31:12.985289+00:00"}