{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JC7EUMJLPKLIJ4FP4QSPYOBTVR","short_pith_number":"pith:JC7EUMJL","canonical_record":{"source":{"id":"1511.04511","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-14T05:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"7e30bf54760932a133cee0d09b794767d2382bb362412f4d9bcd7778f5f8b90d","abstract_canon_sha256":"0c6b7cf4e2ebe77cb2681b3b856a9b15b4c554b151821b06653babac640808ee"},"schema_version":"1.0"},"canonical_sha256":"48be4a312b7a9684f0afe424fc3833ac71d397075cda0e134d25fce312187184","source":{"kind":"arxiv","id":"1511.04511","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04511","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04511v3","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04511","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"JC7EUMJLPKLI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC7EUMJLPKLIJ4FP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC7EUMJL","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JC7EUMJLPKLIJ4FP4QSPYOBTVR","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04511","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-14T05:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"7e30bf54760932a133cee0d09b794767d2382bb362412f4d9bcd7778f5f8b90d","abstract_canon_sha256":"0c6b7cf4e2ebe77cb2681b3b856a9b15b4c554b151821b06653babac640808ee"},"schema_version":"1.0"},"canonical_sha256":"48be4a312b7a9684f0afe424fc3833ac71d397075cda0e134d25fce312187184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:09.906341Z","signature_b64":"xMwhf0pWKOetqygsGChol9e//kUts0ocN4Anqmiwrbnif3LK3Rmm9nLq46VO18bwK7P3uqW+SheM9E9efDbOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48be4a312b7a9684f0afe424fc3833ac71d397075cda0e134d25fce312187184","last_reissued_at":"2026-05-18T00:44:09.905874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:09.905874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04511","source_version":3,"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yu7XhC8syJ3GQMg6ivye5/Tc0weNiVcJqeX9rynRr4JiwDCyi9eDWuEtNzzbKhoRBMVM4rmuCSzSpWMbsihNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:36:36.222864Z"},"content_sha256":"1e2f045571cac08c557fbc0f3b70008bdbabb80cff9ed28eb214811dd52d7667","schema_version":"1.0","event_id":"sha256:1e2f045571cac08c557fbc0f3b70008bdbabb80cff9ed28eb214811dd52d7667"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JC7EUMJLPKLIJ4FP4QSPYOBTVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Optimization for Efficient High-Quality Object Proposal Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ming-Ming Cheng, Philip H.S. Torr, Venkatesh Saligrama, Xi Chen, Yanjun Zhu, Yun Liu, Ziming Zhang","submitted_at":"2015-11-14T05:45:47Z","abstract_excerpt":"We are motivated by the need for a generic object proposal generation algorithm which achieves good balance between object detection recall, proposal localization quality and computational efficiency. We propose a novel object proposal algorithm, BING++, which inherits the virtue of good computational efficiency of BING but significantly improves its proposal localization quality. At high level we formulate the problem of object proposal generation from a novel probabilistic perspective, based on which our BING++ manages to improve the localization quality by employing edges and segments to es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04511","kind":"arxiv","version":3},"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:44:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/VHRPMOxiMTuycaAxNnI6XLpOXX6WZjfJg3vUB37SZaLf3eFj5m5g7/cV2tyjz5kaytTIUAjbpZ7ya3v/IlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:36:36.223212Z"},"content_sha256":"a224889711df885b40e85af8739b50313376444765bfc924d8ade521cdb57a2f","schema_version":"1.0","event_id":"sha256:a224889711df885b40e85af8739b50313376444765bfc924d8ade521cdb57a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR/bundle.json","state_url":"https://pith.science/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR/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-06-07T04:36:36Z","links":{"resolver":"https://pith.science/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR","bundle":"https://pith.science/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR/bundle.json","state":"https://pith.science/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JC7EUMJLPKLIJ4FP4QSPYOBTVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JC7EUMJLPKLIJ4FP4QSPYOBTVR","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":"0c6b7cf4e2ebe77cb2681b3b856a9b15b4c554b151821b06653babac640808ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-14T05:45:47Z","title_canon_sha256":"7e30bf54760932a133cee0d09b794767d2382bb362412f4d9bcd7778f5f8b90d"},"schema_version":"1.0","source":{"id":"1511.04511","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04511","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04511v3","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04511","created_at":"2026-05-18T00:44:09Z"},{"alias_kind":"pith_short_12","alias_value":"JC7EUMJLPKLI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JC7EUMJLPKLIJ4FP","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JC7EUMJL","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:a224889711df885b40e85af8739b50313376444765bfc924d8ade521cdb57a2f","target":"graph","created_at":"2026-05-18T00:44:09Z","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":"We are motivated by the need for a generic object proposal generation algorithm which achieves good balance between object detection recall, proposal localization quality and computational efficiency. We propose a novel object proposal algorithm, BING++, which inherits the virtue of good computational efficiency of BING but significantly improves its proposal localization quality. At high level we formulate the problem of object proposal generation from a novel probabilistic perspective, based on which our BING++ manages to improve the localization quality by employing edges and segments to es","authors_text":"Ming-Ming Cheng, Philip H.S. Torr, Venkatesh Saligrama, Xi Chen, Yanjun Zhu, Yun Liu, Ziming Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-14T05:45:47Z","title":"Sequential Optimization for Efficient High-Quality Object Proposal Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04511","kind":"arxiv","version":3},"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:1e2f045571cac08c557fbc0f3b70008bdbabb80cff9ed28eb214811dd52d7667","target":"record","created_at":"2026-05-18T00:44:09Z","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":"0c6b7cf4e2ebe77cb2681b3b856a9b15b4c554b151821b06653babac640808ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-14T05:45:47Z","title_canon_sha256":"7e30bf54760932a133cee0d09b794767d2382bb362412f4d9bcd7778f5f8b90d"},"schema_version":"1.0","source":{"id":"1511.04511","kind":"arxiv","version":3}},"canonical_sha256":"48be4a312b7a9684f0afe424fc3833ac71d397075cda0e134d25fce312187184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48be4a312b7a9684f0afe424fc3833ac71d397075cda0e134d25fce312187184","first_computed_at":"2026-05-18T00:44:09.905874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:09.905874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xMwhf0pWKOetqygsGChol9e//kUts0ocN4Anqmiwrbnif3LK3Rmm9nLq46VO18bwK7P3uqW+SheM9E9efDbOCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:09.906341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04511","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e2f045571cac08c557fbc0f3b70008bdbabb80cff9ed28eb214811dd52d7667","sha256:a224889711df885b40e85af8739b50313376444765bfc924d8ade521cdb57a2f"],"state_sha256":"727d83172855d9ab10b23c0f76d73a167c82d7b60228e38a92450d9d050a2ee8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qt6hJs/UiLasdwS8po+qfHnIYAZNiHwr2FUneOzBiFhcWFOTF/1ehtqdSaP+GeOyOTYcx+b/H4YSGZZusfh8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:36:36.225160Z","bundle_sha256":"fa87ba8d1617d33dd3074c5a12f5860df7fdbbe9f7ec13801eab3a92c1f9b793"}}