{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6HE7J6NVWVUNX7FKOCNL6VA7PI","short_pith_number":"pith:6HE7J6NV","schema_version":"1.0","canonical_sha256":"f1c9f4f9b5b568dbfcaa709abf541f7a18c8ada25c4fce0835a053fa9963666a","source":{"kind":"arxiv","id":"1901.03796","version":1},"attestation_state":"computed","paper":{"title":"Learning Pairwise Relationship for Multi-object Detection in Crowded Scenes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hamid Rezatofighi, Ian Reid, Lingqiao Liu, Qinfeng Shi, Thanh-Toan Do, Yu Liu","submitted_at":"2019-01-12T04:43:17Z","abstract_excerpt":"As the post-processing step for object detection, non-maximum suppression (GreedyNMS) is widely used in most of the detectors for many years. It is efficient and accurate for sparse scenes, but suffers an inevitable trade-off between precision and recall in crowded scenes. To overcome this drawback, we propose a Pairwise-NMS to cure GreedyNMS. Specifically, a pairwise-relationship network that is based on deep learning is learned to predict if two overlapping proposal boxes contain two objects or zero/one object, which can handle multiple overlapping objects effectively. Through neatly couplin"},"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":"1901.03796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-12T04:43:17Z","cross_cats_sorted":[],"title_canon_sha256":"451251051b46857d7520218fdd13429189aa26466ce96fa70cae2b9e631d824a","abstract_canon_sha256":"f877a44fe6d8c74a643432874408eeed56a74aa9dc2d866eb776aa2d1264af7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:27.016247Z","signature_b64":"5aU0rSrCri/AZYQGxv77gUgqW+nsvkto57fKDnBvUO3P8GQkPdqXMnjgP9oEdvonl9PF+fdpmvM+zfeHuiG0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1c9f4f9b5b568dbfcaa709abf541f7a18c8ada25c4fce0835a053fa9963666a","last_reissued_at":"2026-05-17T23:56:27.015721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:27.015721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Pairwise Relationship for Multi-object Detection in Crowded Scenes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hamid Rezatofighi, Ian Reid, Lingqiao Liu, Qinfeng Shi, Thanh-Toan Do, Yu Liu","submitted_at":"2019-01-12T04:43:17Z","abstract_excerpt":"As the post-processing step for object detection, non-maximum suppression (GreedyNMS) is widely used in most of the detectors for many years. It is efficient and accurate for sparse scenes, but suffers an inevitable trade-off between precision and recall in crowded scenes. To overcome this drawback, we propose a Pairwise-NMS to cure GreedyNMS. Specifically, a pairwise-relationship network that is based on deep learning is learned to predict if two overlapping proposal boxes contain two objects or zero/one object, which can handle multiple overlapping objects effectively. Through neatly couplin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03796","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.03796","created_at":"2026-05-17T23:56:27.015813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03796v1","created_at":"2026-05-17T23:56:27.015813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03796","created_at":"2026-05-17T23:56:27.015813+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HE7J6NVWVUN","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HE7J6NVWVUNX7FK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HE7J6NV","created_at":"2026-05-18T12:33:10.108867+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/6HE7J6NVWVUNX7FKOCNL6VA7PI","json":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI.json","graph_json":"https://pith.science/api/pith-number/6HE7J6NVWVUNX7FKOCNL6VA7PI/graph.json","events_json":"https://pith.science/api/pith-number/6HE7J6NVWVUNX7FKOCNL6VA7PI/events.json","paper":"https://pith.science/paper/6HE7J6NV"},"agent_actions":{"view_html":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI","download_json":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI.json","view_paper":"https://pith.science/paper/6HE7J6NV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03796&json=true","fetch_graph":"https://pith.science/api/pith-number/6HE7J6NVWVUNX7FKOCNL6VA7PI/graph.json","fetch_events":"https://pith.science/api/pith-number/6HE7J6NVWVUNX7FKOCNL6VA7PI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/action/storage_attestation","attest_author":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/action/author_attestation","sign_citation":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/action/citation_signature","submit_replication":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/action/replication_record"}},"created_at":"2026-05-17T23:56:27.015813+00:00","updated_at":"2026-05-17T23:56:27.015813+00:00"}