{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6GWTOLPZGCMWAOK7K3YS7SZLZN","short_pith_number":"pith:6GWTOLPZ","canonical_record":{"source":{"id":"1612.08825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-28T08:46:21Z","cross_cats_sorted":["cs.AI","cs.PF"],"title_canon_sha256":"e062ae0d909c436021b596a4128361498d8da31e763ec6aaa79225cea2d9de3b","abstract_canon_sha256":"32b092894485e6b69745aec0deb5e4df53aa7f7df9d4846b0aa546c61d32a7de"},"schema_version":"1.0"},"canonical_sha256":"f1ad372df9309960395f56f12fcb2bcb49d1d7fd65ed82e6543b176a40b2a071","source":{"kind":"arxiv","id":"1612.08825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08825","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08825v1","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08825","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"pith_short_12","alias_value":"6GWTOLPZGCMW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GWTOLPZGCMWAOK7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GWTOLPZ","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6GWTOLPZGCMWAOK7K3YS7SZLZN","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-28T08:46:21Z","cross_cats_sorted":["cs.AI","cs.PF"],"title_canon_sha256":"e062ae0d909c436021b596a4128361498d8da31e763ec6aaa79225cea2d9de3b","abstract_canon_sha256":"32b092894485e6b69745aec0deb5e4df53aa7f7df9d4846b0aa546c61d32a7de"},"schema_version":"1.0"},"canonical_sha256":"f1ad372df9309960395f56f12fcb2bcb49d1d7fd65ed82e6543b176a40b2a071","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:47.078108Z","signature_b64":"9P+3E5WOA7ZgiPV2oU/eqdgNdm7gv0TJ2u5EljOo3BR3P1c77T66mwmJ2t16HJMy+JcM5e/gidiSKhfjmRADBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ad372df9309960395f56f12fcb2bcb49d1d7fd65ed82e6543b176a40b2a071","last_reissued_at":"2026-05-18T00:53:47.077763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:47.077763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08825","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-18T00:53:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyh2UIOjJCC2WlDxRNPNL4OBqAngbv04yOCe8YmgVgy1wNXU6tn5ljf2ST0HXcwhvzE3nQ32cnJkeVpQryj5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:53.799913Z"},"content_sha256":"afb0eb0b4ba0d21f575ba83fa58650d0667f7be4662fdd5c8b9a1ef1c241c27f","schema_version":"1.0","event_id":"sha256:afb0eb0b4ba0d21f575ba83fa58650d0667f7be4662fdd5c8b9a1ef1c241c27f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6GWTOLPZGCMWAOK7K3YS7SZLZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Convolutions for Efficient Multi-Scale Time to Contact Computation in Julia","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.PF"],"primary_cat":"cs.CV","authors_text":"Alan Edelman, Alexander Amini, Berthold Horn","submitted_at":"2016-12-28T08:46:21Z","abstract_excerpt":"Convolutions have long been regarded as fundamental to applied mathematics, physics and engineering. Their mathematical elegance allows for common tasks such as numerical differentiation to be computed efficiently on large data sets. Efficient computation of convolutions is critical to artificial intelligence in real-time applications, like machine vision, where convolutions must be continuously and efficiently computed on tens to hundreds of kilobytes per second. In this paper, we explore how convolutions are used in fundamental machine vision applications. We present an accelerated n-dimensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08825","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-18T00:53:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jFEdmzUoOLEyGVkjVjKbDq2fOE5uwNwRm5gWrKLZiu8Ac3b9KmFmWrRU0nVjlmHd9wRl4S4E7S8LwKw2AK8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:53.800265Z"},"content_sha256":"0484bb0d627522c7c9a24f2e46d9c123ff15bfe08ed0ba7266f2807bd3ea7d09","schema_version":"1.0","event_id":"sha256:0484bb0d627522c7c9a24f2e46d9c123ff15bfe08ed0ba7266f2807bd3ea7d09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN/bundle.json","state_url":"https://pith.science/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN/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-28T07:59:53Z","links":{"resolver":"https://pith.science/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN","bundle":"https://pith.science/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN/bundle.json","state":"https://pith.science/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GWTOLPZGCMWAOK7K3YS7SZLZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6GWTOLPZGCMWAOK7K3YS7SZLZN","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":"32b092894485e6b69745aec0deb5e4df53aa7f7df9d4846b0aa546c61d32a7de","cross_cats_sorted":["cs.AI","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-28T08:46:21Z","title_canon_sha256":"e062ae0d909c436021b596a4128361498d8da31e763ec6aaa79225cea2d9de3b"},"schema_version":"1.0","source":{"id":"1612.08825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08825","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08825v1","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08825","created_at":"2026-05-18T00:53:47Z"},{"alias_kind":"pith_short_12","alias_value":"6GWTOLPZGCMW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6GWTOLPZGCMWAOK7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6GWTOLPZ","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:0484bb0d627522c7c9a24f2e46d9c123ff15bfe08ed0ba7266f2807bd3ea7d09","target":"graph","created_at":"2026-05-18T00:53:47Z","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":"Convolutions have long been regarded as fundamental to applied mathematics, physics and engineering. Their mathematical elegance allows for common tasks such as numerical differentiation to be computed efficiently on large data sets. Efficient computation of convolutions is critical to artificial intelligence in real-time applications, like machine vision, where convolutions must be continuously and efficiently computed on tens to hundreds of kilobytes per second. In this paper, we explore how convolutions are used in fundamental machine vision applications. We present an accelerated n-dimensi","authors_text":"Alan Edelman, Alexander Amini, Berthold Horn","cross_cats":["cs.AI","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-28T08:46:21Z","title":"Accelerated Convolutions for Efficient Multi-Scale Time to Contact Computation in Julia"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08825","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:afb0eb0b4ba0d21f575ba83fa58650d0667f7be4662fdd5c8b9a1ef1c241c27f","target":"record","created_at":"2026-05-18T00:53:47Z","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":"32b092894485e6b69745aec0deb5e4df53aa7f7df9d4846b0aa546c61d32a7de","cross_cats_sorted":["cs.AI","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-12-28T08:46:21Z","title_canon_sha256":"e062ae0d909c436021b596a4128361498d8da31e763ec6aaa79225cea2d9de3b"},"schema_version":"1.0","source":{"id":"1612.08825","kind":"arxiv","version":1}},"canonical_sha256":"f1ad372df9309960395f56f12fcb2bcb49d1d7fd65ed82e6543b176a40b2a071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1ad372df9309960395f56f12fcb2bcb49d1d7fd65ed82e6543b176a40b2a071","first_computed_at":"2026-05-18T00:53:47.077763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:47.077763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9P+3E5WOA7ZgiPV2oU/eqdgNdm7gv0TJ2u5EljOo3BR3P1c77T66mwmJ2t16HJMy+JcM5e/gidiSKhfjmRADBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:47.078108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afb0eb0b4ba0d21f575ba83fa58650d0667f7be4662fdd5c8b9a1ef1c241c27f","sha256:0484bb0d627522c7c9a24f2e46d9c123ff15bfe08ed0ba7266f2807bd3ea7d09"],"state_sha256":"88afb108e9375999a7bfa0d1b603746cd4fffff53cc1d2fad3d9f7fecc892fc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLx0g8GxC//ZX7r2C69NFENKpMy5gEMrjL/d0PUCOlyW77Ne+NNWqGjl0boLRuvyIT06t18WFAFbaaKqC9XvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:59:53.802239Z","bundle_sha256":"74e03e2cb5830bb07b3b35e56a47f7a3c3784f5b9e8606222856ef7279f0ed81"}}