{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IFTCOPHGUJFSRPEMFVEJY76SNK","short_pith_number":"pith:IFTCOPHG","schema_version":"1.0","canonical_sha256":"4166273ce6a24b28bc8c2d489c7fd26ab4c719da975d4385304359752e187362","source":{"kind":"arxiv","id":"1412.1441","version":3},"attestation_state":"computed","paper":{"title":"Scalable, High-Quality Object Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Christian Szegedy, Dragomir Anguelov, Dumitru Erhan, Scott Reed, Sergey Ioffe","submitted_at":"2014-12-03T19:03:55Z","abstract_excerpt":"Current high-quality object detection approaches use the scheme of salience-based object proposal methods followed by post-classification using deep convolutional features. This spurred recent research in improving object proposal methods. However, domain agnostic proposal generation has the principal drawback that the proposals come unranked or with very weak ranking, making it hard to trade-off quality for running time. This raises the more fundamental question of whether high-quality proposal generation requires careful engineering or can be derived just from data alone. We demonstrate that"},"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":"1412.1441","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-03T19:03:55Z","cross_cats_sorted":[],"title_canon_sha256":"34f4b3f317155ab44dccce4d3947c1470285f897d65506756cae1510b7067e00","abstract_canon_sha256":"12b62a9b031a7601621c47abafac1a5c937189a9665dc9d3b1f3fd4ba0ba4ed2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:43.857563Z","signature_b64":"Btg3C/MPLKn3YBza/zqvuS1xKfeoYMFMeEAQO9IQtCx8F+5Dphup6AL7Vsee2GUU7FFcXgoqmf+ueqd1RISaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4166273ce6a24b28bc8c2d489c7fd26ab4c719da975d4385304359752e187362","last_reissued_at":"2026-05-18T01:24:43.857022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:43.857022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable, High-Quality Object Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Christian Szegedy, Dragomir Anguelov, Dumitru Erhan, Scott Reed, Sergey Ioffe","submitted_at":"2014-12-03T19:03:55Z","abstract_excerpt":"Current high-quality object detection approaches use the scheme of salience-based object proposal methods followed by post-classification using deep convolutional features. This spurred recent research in improving object proposal methods. However, domain agnostic proposal generation has the principal drawback that the proposals come unranked or with very weak ranking, making it hard to trade-off quality for running time. This raises the more fundamental question of whether high-quality proposal generation requires careful engineering or can be derived just from data alone. We demonstrate that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1441","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1441","created_at":"2026-05-18T01:24:43.857114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1441v3","created_at":"2026-05-18T01:24:43.857114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1441","created_at":"2026-05-18T01:24:43.857114+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFTCOPHGUJFS","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFTCOPHGUJFSRPEM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFTCOPHG","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1907.03402","citing_title":"Distill-2MD-MTL: Data Distillation based on Multi-Dataset Multi-Domain Multi-Task Frame Work to Solve Face Related Tasksks, Multi Task Learning, Semi-Supervised Learning","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"1907.10310","citing_title":"Towards Adversarially Robust Object Detection","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18804","citing_title":"Adaptive Multi-Scale Goodness Aggregation for Forward-Forward Learning","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK","json":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK.json","graph_json":"https://pith.science/api/pith-number/IFTCOPHGUJFSRPEMFVEJY76SNK/graph.json","events_json":"https://pith.science/api/pith-number/IFTCOPHGUJFSRPEMFVEJY76SNK/events.json","paper":"https://pith.science/paper/IFTCOPHG"},"agent_actions":{"view_html":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK","download_json":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK.json","view_paper":"https://pith.science/paper/IFTCOPHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1441&json=true","fetch_graph":"https://pith.science/api/pith-number/IFTCOPHGUJFSRPEMFVEJY76SNK/graph.json","fetch_events":"https://pith.science/api/pith-number/IFTCOPHGUJFSRPEMFVEJY76SNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK/action/storage_attestation","attest_author":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK/action/author_attestation","sign_citation":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK/action/citation_signature","submit_replication":"https://pith.science/pith/IFTCOPHGUJFSRPEMFVEJY76SNK/action/replication_record"}},"created_at":"2026-05-18T01:24:43.857114+00:00","updated_at":"2026-05-18T01:24:43.857114+00:00"}