{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T3ZHLUTLS66FYPWUWVLAHLLWYS","short_pith_number":"pith:T3ZHLUTL","schema_version":"1.0","canonical_sha256":"9ef275d26b97bc5c3ed4b55603ad76c485866e9b6b0156191c66db6023ec4e27","source":{"kind":"arxiv","id":"1511.03296","version":2},"attestation_state":"computed","paper":{"title":"The Fast Bilateral Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ben Poole, Jonathan T. Barron","submitted_at":"2015-11-10T21:19:34Z","abstract_excerpt":"We present the bilateral solver, a novel algorithm for edge-aware smoothing that combines the flexibility and speed of simple filtering approaches with the accuracy of domain-specific optimization algorithms. Our technique is capable of matching or improving upon state-of-the-art results on several different computer vision tasks (stereo, depth superresolution, colorization, and semantic segmentation) while being 10-1000 times faster than competing approaches. The bilateral solver is fast, robust, straightforward to generalize to new domains, and simple to integrate into deep learning pipeline"},"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":"1511.03296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-10T21:19:34Z","cross_cats_sorted":[],"title_canon_sha256":"7d00d855c6ee9bdad24a86ab57d4628b5dac15a9324540232847770cb63c46eb","abstract_canon_sha256":"c5477ef2c765384eeaf86f25d92d2581d0566151f4df0dd85bf1685c50d0dfe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:40.002195Z","signature_b64":"djJaFnmLd6LAQC1hbPKwFmw4i7Dq/pSPXfO+bSnlvpXCVYvhpukVGpfPUoWwNcwf93KtmF+uoW7B2lWI1BV1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ef275d26b97bc5c3ed4b55603ad76c485866e9b6b0156191c66db6023ec4e27","last_reissued_at":"2026-05-18T01:10:40.000813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:40.000813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Fast Bilateral Solver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ben Poole, Jonathan T. Barron","submitted_at":"2015-11-10T21:19:34Z","abstract_excerpt":"We present the bilateral solver, a novel algorithm for edge-aware smoothing that combines the flexibility and speed of simple filtering approaches with the accuracy of domain-specific optimization algorithms. Our technique is capable of matching or improving upon state-of-the-art results on several different computer vision tasks (stereo, depth superresolution, colorization, and semantic segmentation) while being 10-1000 times faster than competing approaches. The bilateral solver is fast, robust, straightforward to generalize to new domains, and simple to integrate into deep learning pipeline"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03296","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.03296","created_at":"2026-05-18T01:10:40.000895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03296v2","created_at":"2026-05-18T01:10:40.000895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03296","created_at":"2026-05-18T01:10:40.000895+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3ZHLUTLS66F","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3ZHLUTLS66FYPWU","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3ZHLUTL","created_at":"2026-05-18T12:29:42.218222+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/T3ZHLUTLS66FYPWUWVLAHLLWYS","json":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS.json","graph_json":"https://pith.science/api/pith-number/T3ZHLUTLS66FYPWUWVLAHLLWYS/graph.json","events_json":"https://pith.science/api/pith-number/T3ZHLUTLS66FYPWUWVLAHLLWYS/events.json","paper":"https://pith.science/paper/T3ZHLUTL"},"agent_actions":{"view_html":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS","download_json":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS.json","view_paper":"https://pith.science/paper/T3ZHLUTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03296&json=true","fetch_graph":"https://pith.science/api/pith-number/T3ZHLUTLS66FYPWUWVLAHLLWYS/graph.json","fetch_events":"https://pith.science/api/pith-number/T3ZHLUTLS66FYPWUWVLAHLLWYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS/action/storage_attestation","attest_author":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS/action/author_attestation","sign_citation":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS/action/citation_signature","submit_replication":"https://pith.science/pith/T3ZHLUTLS66FYPWUWVLAHLLWYS/action/replication_record"}},"created_at":"2026-05-18T01:10:40.000895+00:00","updated_at":"2026-05-18T01:10:40.000895+00:00"}