{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IFB3CGG6E5CJUDQ4H6WPNWPU4L","short_pith_number":"pith:IFB3CGG6","canonical_record":{"source":{"id":"1907.10156","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-23T22:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"9ad3b76c251ff8e5fb9ac4a93439cedd5884c0ee67e339d01ea455736e3831e8","abstract_canon_sha256":"2c85243ce70a4c6511c2b0019a7fe48357a1c6f1176fadd55fab24b1cc537848"},"schema_version":"1.0"},"canonical_sha256":"4143b118de27449a0e1c3facf6d9f4e2cf084fc54ebe1a281d9237893349508e","source":{"kind":"arxiv","id":"1907.10156","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10156","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10156v3","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10156","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"pith_short_12","alias_value":"IFB3CGG6E5CJ","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"pith_short_16","alias_value":"IFB3CGG6E5CJUDQ4","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"pith_short_8","alias_value":"IFB3CGG6","created_at":"2026-07-05T00:54:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IFB3CGG6E5CJUDQ4H6WPNWPU4L","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10156","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-23T22:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"9ad3b76c251ff8e5fb9ac4a93439cedd5884c0ee67e339d01ea455736e3831e8","abstract_canon_sha256":"2c85243ce70a4c6511c2b0019a7fe48357a1c6f1176fadd55fab24b1cc537848"},"schema_version":"1.0"},"canonical_sha256":"4143b118de27449a0e1c3facf6d9f4e2cf084fc54ebe1a281d9237893349508e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:29.829348Z","signature_b64":"ZKnEgcNspa923p21vkhrxc7NFvKM2K2DLmiD8TD+pLb4NEaLxEcGnN86Nzhg1QLuGIe+3/RqEfGaz8pxKhFGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4143b118de27449a0e1c3facf6d9f4e2cf084fc54ebe1a281d9237893349508e","last_reissued_at":"2026-07-05T00:54:29.828962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:29.828962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10156","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-07-05T00:54:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oZKLQ01dcavUw52sTMj282QooUirEdJj3v/7sd426rSNmZp7jXSfoNSdHEm5zufG9XtzunsBp2UBe2MGq78BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:49:02.031015Z"},"content_sha256":"8ea9c9571a0548e4dded94e2b73cf6743ea1fc9ac43868b2732bbf1075020629","schema_version":"1.0","event_id":"sha256:8ea9c9571a0548e4dded94e2b73cf6743ea1fc9ac43868b2732bbf1075020629"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IFB3CGG6E5CJUDQ4H6WPNWPU4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DR Loss: Improving Object Detection by Distributional Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hao Li, Lei Chen, Qi Qian, Rong Jin","submitted_at":"2019-07-23T22:14:38Z","abstract_excerpt":"Most of object detection algorithms can be categorized into two classes: two-stage detectors and one-stage detectors. Recently, many efforts have been devoted to one-stage detectors for the simple yet effective architecture. Different from two-stage detectors, one-stage detectors aim to identify foreground objects from all candidates in a single stage. This architecture is efficient but can suffer from the imbalance issue with respect to two aspects: the inter-class imbalance between the number of candidates from foreground and background classes and the intra-class imbalance in the hardness o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10156","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.10156/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:54:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwpK6QYlde7hTFvvrC67+lSuwdbb+H2jL/TofyQwolEjWwpY9wcPjlcWLirmNPu/Dcjh+hpEV5U+JfsRh4QcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:49:02.031523Z"},"content_sha256":"94e848c214b48e51bdcf0d37f8deebc039c2ab13652ac5d64499975e5cd3860c","schema_version":"1.0","event_id":"sha256:94e848c214b48e51bdcf0d37f8deebc039c2ab13652ac5d64499975e5cd3860c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L/bundle.json","state_url":"https://pith.science/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L/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-15T05:49:02Z","links":{"resolver":"https://pith.science/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L","bundle":"https://pith.science/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L/bundle.json","state":"https://pith.science/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFB3CGG6E5CJUDQ4H6WPNWPU4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IFB3CGG6E5CJUDQ4H6WPNWPU4L","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":"2c85243ce70a4c6511c2b0019a7fe48357a1c6f1176fadd55fab24b1cc537848","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-23T22:14:38Z","title_canon_sha256":"9ad3b76c251ff8e5fb9ac4a93439cedd5884c0ee67e339d01ea455736e3831e8"},"schema_version":"1.0","source":{"id":"1907.10156","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10156","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10156v3","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10156","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"pith_short_12","alias_value":"IFB3CGG6E5CJ","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"pith_short_16","alias_value":"IFB3CGG6E5CJUDQ4","created_at":"2026-07-05T00:54:29Z"},{"alias_kind":"pith_short_8","alias_value":"IFB3CGG6","created_at":"2026-07-05T00:54:29Z"}],"graph_snapshots":[{"event_id":"sha256:94e848c214b48e51bdcf0d37f8deebc039c2ab13652ac5d64499975e5cd3860c","target":"graph","created_at":"2026-07-05T00:54:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.10156/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most of object detection algorithms can be categorized into two classes: two-stage detectors and one-stage detectors. Recently, many efforts have been devoted to one-stage detectors for the simple yet effective architecture. Different from two-stage detectors, one-stage detectors aim to identify foreground objects from all candidates in a single stage. This architecture is efficient but can suffer from the imbalance issue with respect to two aspects: the inter-class imbalance between the number of candidates from foreground and background classes and the intra-class imbalance in the hardness o","authors_text":"Hao Li, Lei Chen, Qi Qian, Rong Jin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-23T22:14:38Z","title":"DR Loss: Improving Object Detection by Distributional Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10156","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:8ea9c9571a0548e4dded94e2b73cf6743ea1fc9ac43868b2732bbf1075020629","target":"record","created_at":"2026-07-05T00:54:29Z","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":"2c85243ce70a4c6511c2b0019a7fe48357a1c6f1176fadd55fab24b1cc537848","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-23T22:14:38Z","title_canon_sha256":"9ad3b76c251ff8e5fb9ac4a93439cedd5884c0ee67e339d01ea455736e3831e8"},"schema_version":"1.0","source":{"id":"1907.10156","kind":"arxiv","version":3}},"canonical_sha256":"4143b118de27449a0e1c3facf6d9f4e2cf084fc54ebe1a281d9237893349508e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4143b118de27449a0e1c3facf6d9f4e2cf084fc54ebe1a281d9237893349508e","first_computed_at":"2026-07-05T00:54:29.828962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:29.828962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZKnEgcNspa923p21vkhrxc7NFvKM2K2DLmiD8TD+pLb4NEaLxEcGnN86Nzhg1QLuGIe+3/RqEfGaz8pxKhFGCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:29.829348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10156","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ea9c9571a0548e4dded94e2b73cf6743ea1fc9ac43868b2732bbf1075020629","sha256:94e848c214b48e51bdcf0d37f8deebc039c2ab13652ac5d64499975e5cd3860c"],"state_sha256":"7cebeca22077aee3b1d80553941f8b2edd1bd5f43a621607045943af510d5851"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"grRabQ2j4Nw7z387nfZZzyjN0VHZVIzLiDH2RyvMVUP/k07UUxZF/vEfFr8+jzpVPBHcB0zjciWo/yM0CnOdAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:49:02.035771Z","bundle_sha256":"eac031e3212153fdc52256b2e9da4eb8f387cf62ae8a6224ecb93f679264ad90"}}