{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6HE7J6NVWVUNX7FKOCNL6VA7PI","short_pith_number":"pith:6HE7J6NV","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"},"canonical_sha256":"f1c9f4f9b5b568dbfcaa709abf541f7a18c8ada25c4fce0835a053fa9963666a","source":{"kind":"arxiv","id":"1901.03796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03796","created_at":"2026-05-17T23:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03796v1","created_at":"2026-05-17T23:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03796","created_at":"2026-05-17T23:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"6HE7J6NVWVUN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6HE7J6NVWVUNX7FK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6HE7J6NV","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6HE7J6NVWVUNX7FKOCNL6VA7PI","target":"record","payload":{"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"},"canonical_sha256":"f1c9f4f9b5b568dbfcaa709abf541f7a18c8ada25c4fce0835a053fa9963666a","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"},"source_kind":"arxiv","source_id":"1901.03796","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-17T23:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XJT/+tXICeXx74aD+xX3gQj4Cah1mn16LwXqeuhVq+1gF7VUESouyTNL4diQAF4DUv2bDn04GSuWJa/tbiL6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:51:58.771037Z"},"content_sha256":"2657a621b0c0b8bfff104442cb895160ddbe65dab402d135507916fe4521f5b8","schema_version":"1.0","event_id":"sha256:2657a621b0c0b8bfff104442cb895160ddbe65dab402d135507916fe4521f5b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6HE7J6NVWVUNX7FKOCNL6VA7PI","target":"graph","payload":{"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"},"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-17T23:56:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BcYy+UCq4Pttcr/mNjYYchMtkwFxrBIudzmKvFQpVxCEeFhMKA6H8SazsxrkhCrTfmNIe4zyuyE61+JyvAUnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:51:58.771385Z"},"content_sha256":"fdd99e5fd11c084597a7ea0812dadf1cc72a812852a65bf66a164749f61cf107","schema_version":"1.0","event_id":"sha256:fdd99e5fd11c084597a7ea0812dadf1cc72a812852a65bf66a164749f61cf107"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/bundle.json","state_url":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/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-28T08:51:58Z","links":{"resolver":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI","bundle":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/bundle.json","state":"https://pith.science/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HE7J6NVWVUNX7FKOCNL6VA7PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6HE7J6NVWVUNX7FKOCNL6VA7PI","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":"f877a44fe6d8c74a643432874408eeed56a74aa9dc2d866eb776aa2d1264af7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-12T04:43:17Z","title_canon_sha256":"451251051b46857d7520218fdd13429189aa26466ce96fa70cae2b9e631d824a"},"schema_version":"1.0","source":{"id":"1901.03796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03796","created_at":"2026-05-17T23:56:27Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03796v1","created_at":"2026-05-17T23:56:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03796","created_at":"2026-05-17T23:56:27Z"},{"alias_kind":"pith_short_12","alias_value":"6HE7J6NVWVUN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6HE7J6NVWVUNX7FK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6HE7J6NV","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:fdd99e5fd11c084597a7ea0812dadf1cc72a812852a65bf66a164749f61cf107","target":"graph","created_at":"2026-05-17T23:56:27Z","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":"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","authors_text":"Hamid Rezatofighi, Ian Reid, Lingqiao Liu, Qinfeng Shi, Thanh-Toan Do, Yu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-12T04:43:17Z","title":"Learning Pairwise Relationship for Multi-object Detection in Crowded Scenes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03796","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:2657a621b0c0b8bfff104442cb895160ddbe65dab402d135507916fe4521f5b8","target":"record","created_at":"2026-05-17T23:56:27Z","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":"f877a44fe6d8c74a643432874408eeed56a74aa9dc2d866eb776aa2d1264af7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-12T04:43:17Z","title_canon_sha256":"451251051b46857d7520218fdd13429189aa26466ce96fa70cae2b9e631d824a"},"schema_version":"1.0","source":{"id":"1901.03796","kind":"arxiv","version":1}},"canonical_sha256":"f1c9f4f9b5b568dbfcaa709abf541f7a18c8ada25c4fce0835a053fa9963666a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1c9f4f9b5b568dbfcaa709abf541f7a18c8ada25c4fce0835a053fa9963666a","first_computed_at":"2026-05-17T23:56:27.015721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:27.015721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5aU0rSrCri/AZYQGxv77gUgqW+nsvkto57fKDnBvUO3P8GQkPdqXMnjgP9oEdvonl9PF+fdpmvM+zfeHuiG0Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:27.016247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2657a621b0c0b8bfff104442cb895160ddbe65dab402d135507916fe4521f5b8","sha256:fdd99e5fd11c084597a7ea0812dadf1cc72a812852a65bf66a164749f61cf107"],"state_sha256":"750cb0cdd3f970c985852a852f0f565c4f9b7eee45a6edf0d1c2f5a33fcaaa9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndBK6m3FHhtzVHzctC7F9O2xldDqIgE2HZob5MhFunpXYRzC9RMwkZEtLDbqyN42EMqKzPz86STaAlTao064Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:51:58.773464Z","bundle_sha256":"d24a95579c958aaac561191cd4f56fd4938b13ed401d63e11ff7ddabacae5aad"}}