{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:75OGFKYFVJ52H7YN7JLWNND3WU","short_pith_number":"pith:75OGFKYF","schema_version":"1.0","canonical_sha256":"ff5c62ab05aa7ba3ff0dfa5766b47bb5285db934136c482a8f5b84417aeb6272","source":{"kind":"arxiv","id":"2306.05238","version":2},"attestation_state":"computed","paper":{"title":"SparseTrack: Multi-Object Tracking by Performing Scene Decomposition based on Pseudo-Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cheng Wang, Wenyu Liu, Xiang Bai, Xinggang Wang, Zelin Liu","submitted_at":"2023-06-08T14:36:10Z","abstract_excerpt":"Exploring robust and efficient association methods has always been an important issue in multiple-object tracking (MOT). Although existing tracking methods have achieved impressive performance, congestion and frequent occlusions still pose challenging problems in multi-object tracking. We reveal that performing sparse decomposition on dense scenes is a crucial step to enhance the performance of associating occluded targets. To this end, we propose a pseudo-depth estimation method for obtaining the relative depth of targets from 2D images. Secondly, we design a depth cascading matching (DCM) al"},"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":"2306.05238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-06-08T14:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"a2d199eb6b6173836c977cb29510358b4bbe1dab7938f53f04151563d8c7e2c3","abstract_canon_sha256":"e54962c7a67ccbf6500392cfb512087f195fc3140b6c32cdddfa0845c0c8b5f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:13.520381Z","signature_b64":"plxj9Nm5EP7zTdg67GN0nfgXGntFZMCI+yvjXvIAxUA8iWF5bVsbTlV2V3kS1eGLfw1oSVV0NLCAKMx4sUgmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff5c62ab05aa7ba3ff0dfa5766b47bb5285db934136c482a8f5b84417aeb6272","last_reissued_at":"2026-07-05T07:14:13.519861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:13.519861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SparseTrack: Multi-Object Tracking by Performing Scene Decomposition based on Pseudo-Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cheng Wang, Wenyu Liu, Xiang Bai, Xinggang Wang, Zelin Liu","submitted_at":"2023-06-08T14:36:10Z","abstract_excerpt":"Exploring robust and efficient association methods has always been an important issue in multiple-object tracking (MOT). Although existing tracking methods have achieved impressive performance, congestion and frequent occlusions still pose challenging problems in multi-object tracking. We reveal that performing sparse decomposition on dense scenes is a crucial step to enhance the performance of associating occluded targets. To this end, we propose a pseudo-depth estimation method for obtaining the relative depth of targets from 2D images. Secondly, we design a depth cascading matching (DCM) al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.05238","kind":"arxiv","version":2},"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/2306.05238/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.05238","created_at":"2026-07-05T07:14:13.519917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.05238v2","created_at":"2026-07-05T07:14:13.519917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.05238","created_at":"2026-07-05T07:14:13.519917+00:00"},{"alias_kind":"pith_short_12","alias_value":"75OGFKYFVJ52","created_at":"2026-07-05T07:14:13.519917+00:00"},{"alias_kind":"pith_short_16","alias_value":"75OGFKYFVJ52H7YN","created_at":"2026-07-05T07:14:13.519917+00:00"},{"alias_kind":"pith_short_8","alias_value":"75OGFKYF","created_at":"2026-07-05T07:14:13.519917+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.20239","citing_title":"Occlusion-Aware Multi-Object Tracking via Expected Probability of Detection","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12665","citing_title":"Hypergraph-State Collaborative Reasoning for Multi-Object Tracking","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU","json":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU.json","graph_json":"https://pith.science/api/pith-number/75OGFKYFVJ52H7YN7JLWNND3WU/graph.json","events_json":"https://pith.science/api/pith-number/75OGFKYFVJ52H7YN7JLWNND3WU/events.json","paper":"https://pith.science/paper/75OGFKYF"},"agent_actions":{"view_html":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU","download_json":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU.json","view_paper":"https://pith.science/paper/75OGFKYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.05238&json=true","fetch_graph":"https://pith.science/api/pith-number/75OGFKYFVJ52H7YN7JLWNND3WU/graph.json","fetch_events":"https://pith.science/api/pith-number/75OGFKYFVJ52H7YN7JLWNND3WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU/action/storage_attestation","attest_author":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU/action/author_attestation","sign_citation":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU/action/citation_signature","submit_replication":"https://pith.science/pith/75OGFKYFVJ52H7YN7JLWNND3WU/action/replication_record"}},"created_at":"2026-07-05T07:14:13.519917+00:00","updated_at":"2026-07-05T07:14:13.519917+00:00"}