{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D5GYBWAJ5Z5EOMQRVEU4DTMACC","short_pith_number":"pith:D5GYBWAJ","canonical_record":{"source":{"id":"1509.08197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-28T05:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"f94a0a7b8c173204a02ac3178fc9128cba45151b7f75faf6a0ad3cfe5d9ced9c","abstract_canon_sha256":"d51a077c86e652f4423da72f679551dbaedd5cf88a88918dcd9604d12689e311"},"schema_version":"1.0"},"canonical_sha256":"1f4d80d809ee7a473211a929c1cd8010ba647e29a983b6733f7494d6411243d9","source":{"kind":"arxiv","id":"1509.08197","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08197","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08197v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08197","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"D5GYBWAJ5Z5E","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5GYBWAJ5Z5EOMQR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5GYBWAJ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D5GYBWAJ5Z5EOMQRVEU4DTMACC","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08197","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-28T05:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"f94a0a7b8c173204a02ac3178fc9128cba45151b7f75faf6a0ad3cfe5d9ced9c","abstract_canon_sha256":"d51a077c86e652f4423da72f679551dbaedd5cf88a88918dcd9604d12689e311"},"schema_version":"1.0"},"canonical_sha256":"1f4d80d809ee7a473211a929c1cd8010ba647e29a983b6733f7494d6411243d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:54.527345Z","signature_b64":"UX4tJu303Z1Dy+OCaCjvtFhpy4Ps4Ji73PCJ4UKLzdSzQ876c+0IORl0nDVH/aoHSJwrGBvyhN8qrl0kMbB0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f4d80d809ee7a473211a929c1cd8010ba647e29a983b6733f7494d6411243d9","last_reissued_at":"2026-05-18T01:31:54.526951Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:54.526951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08197","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-18T01:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LaEjBhHq0sTsHZEz0+azUcO+B+1+Yhr3bTI7Sk3rv6yIrAp27BSZrykJIm68qVZcROAz0Iad4RlhSxRQO/8fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:42:42.965674Z"},"content_sha256":"ae82704bbfb21168ad2ed987049babb363188fcf8d414ab318a0b24d0fee1df7","schema_version":"1.0","event_id":"sha256:ae82704bbfb21168ad2ed987049babb363188fcf8d414ab318a0b24d0fee1df7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D5GYBWAJ5Z5EOMQRVEU4DTMACC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Non-local Stereo Matching based on Hierarchical Disparity Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hongtao Lu, Sei-ichiro Kamata, Shuo Li, Xuan Luo, Xuejiao Bai","submitted_at":"2015-09-28T05:00:01Z","abstract_excerpt":"Stereo matching is the key step in estimating depth from two or more images. Recently, some tree-based non-local stereo matching methods have been proposed, which achieved state-of-the-art performance. The algorithms employed some tree structures to aggregate cost and thus improved the performance and reduced the coputation load of the stereo matching. However, the computational complexity of these tree-based algorithms is still high because they search over the entire disparity range. In addition, the extreme greediness of the minimum spanning tree (MST) causes the poor performance in large a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08197","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-18T01:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06ahZnfpqk3iGKLAolknR5S6oj9WNv0BGaQ9MWvJ0PO08WIdSOJbCbFhmzbLtP/AYJ4vUDb1mwLtvzvqQsqjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:42:42.966132Z"},"content_sha256":"795b2cbeaeebb8846aa74c0c991f3b7a84046a2658989cbf863b4cb3f09466ec","schema_version":"1.0","event_id":"sha256:795b2cbeaeebb8846aa74c0c991f3b7a84046a2658989cbf863b4cb3f09466ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC/bundle.json","state_url":"https://pith.science/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC/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-08-19T00:42:42Z","links":{"resolver":"https://pith.science/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC","bundle":"https://pith.science/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC/bundle.json","state":"https://pith.science/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5GYBWAJ5Z5EOMQRVEU4DTMACC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D5GYBWAJ5Z5EOMQRVEU4DTMACC","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":"d51a077c86e652f4423da72f679551dbaedd5cf88a88918dcd9604d12689e311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-28T05:00:01Z","title_canon_sha256":"f94a0a7b8c173204a02ac3178fc9128cba45151b7f75faf6a0ad3cfe5d9ced9c"},"schema_version":"1.0","source":{"id":"1509.08197","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08197","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08197v1","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08197","created_at":"2026-05-18T01:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"D5GYBWAJ5Z5E","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5GYBWAJ5Z5EOMQR","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5GYBWAJ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:795b2cbeaeebb8846aa74c0c991f3b7a84046a2658989cbf863b4cb3f09466ec","target":"graph","created_at":"2026-05-18T01:31:54Z","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":"Stereo matching is the key step in estimating depth from two or more images. Recently, some tree-based non-local stereo matching methods have been proposed, which achieved state-of-the-art performance. The algorithms employed some tree structures to aggregate cost and thus improved the performance and reduced the coputation load of the stereo matching. However, the computational complexity of these tree-based algorithms is still high because they search over the entire disparity range. In addition, the extreme greediness of the minimum spanning tree (MST) causes the poor performance in large a","authors_text":"Hongtao Lu, Sei-ichiro Kamata, Shuo Li, Xuan Luo, Xuejiao Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-28T05:00:01Z","title":"Fast Non-local Stereo Matching based on Hierarchical Disparity Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08197","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:ae82704bbfb21168ad2ed987049babb363188fcf8d414ab318a0b24d0fee1df7","target":"record","created_at":"2026-05-18T01:31:54Z","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":"d51a077c86e652f4423da72f679551dbaedd5cf88a88918dcd9604d12689e311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-28T05:00:01Z","title_canon_sha256":"f94a0a7b8c173204a02ac3178fc9128cba45151b7f75faf6a0ad3cfe5d9ced9c"},"schema_version":"1.0","source":{"id":"1509.08197","kind":"arxiv","version":1}},"canonical_sha256":"1f4d80d809ee7a473211a929c1cd8010ba647e29a983b6733f7494d6411243d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f4d80d809ee7a473211a929c1cd8010ba647e29a983b6733f7494d6411243d9","first_computed_at":"2026-05-18T01:31:54.526951Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:54.526951Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UX4tJu303Z1Dy+OCaCjvtFhpy4Ps4Ji73PCJ4UKLzdSzQ876c+0IORl0nDVH/aoHSJwrGBvyhN8qrl0kMbB0DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:54.527345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08197","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae82704bbfb21168ad2ed987049babb363188fcf8d414ab318a0b24d0fee1df7","sha256:795b2cbeaeebb8846aa74c0c991f3b7a84046a2658989cbf863b4cb3f09466ec"],"state_sha256":"f89956496647d12c176c6ae96b2ff0b10a4e5faab15700fc3815aae499dee63e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwwPkbzWF9mVZaie5RPpKxeIR35xmimBgkwiq2nXRmjOhfuQ2afTlk4hZNRA4je2zSZa3H6MZKSnD7JTmLKpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T00:42:42.971586Z","bundle_sha256":"e0ad20a06c42ba3f70261c0343569ff9abab13ed4fe2eca9f8ab01139bba7260"}}