{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VVRBLTGRCPQGF44MZUEKLW7M2X","short_pith_number":"pith:VVRBLTGR","schema_version":"1.0","canonical_sha256":"ad6215ccd113e062f38ccd08a5dbecd5c190aa8cde8ee1bae2ebee3a141e3167","source":{"kind":"arxiv","id":"1706.08482","version":1},"attestation_state":"computed","paper":{"title":"Deep Network Flow for Multi-Object Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Manmohan Chandraker, Paul Vernaza, Samuel Schulter, Wongun Choi","submitted_at":"2017-06-26T17:08:45Z","abstract_excerpt":"Data association problems are an important component of many computer vision applications, with multi-object tracking being one of the most prominent examples. A typical approach to data association involves finding a graph matching or network flow that minimizes a sum of pairwise association costs, which are often either hand-crafted or learned as linear functions of fixed features. In this work, we demonstrate that it is possible to learn features for network-flow-based data association via backpropagation, by expressing the optimum of a smoothed network flow problem as a differentiable func"},"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":"1706.08482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-06-26T17:08:45Z","cross_cats_sorted":[],"title_canon_sha256":"d01ff3cd78831e5ed2682396e9648c0a580fef1f7f8588398c46c0cbd5ccf603","abstract_canon_sha256":"13aa10b3015d718f49a1b4a4a9176c6e57304c4d5e7257c284644f54b1a18708"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:42.492031Z","signature_b64":"6ZyGpB5sqfkA/8JiiqyYzbrAokRy1BoOp1NNeIn/pkadzsRhdZEU9v9L41HwTS/mF7IaOrTnsWosOaXgiFw2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad6215ccd113e062f38ccd08a5dbecd5c190aa8cde8ee1bae2ebee3a141e3167","last_reissued_at":"2026-05-18T00:41:42.491584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:42.491584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Network Flow for Multi-Object Tracking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Manmohan Chandraker, Paul Vernaza, Samuel Schulter, Wongun Choi","submitted_at":"2017-06-26T17:08:45Z","abstract_excerpt":"Data association problems are an important component of many computer vision applications, with multi-object tracking being one of the most prominent examples. A typical approach to data association involves finding a graph matching or network flow that minimizes a sum of pairwise association costs, which are often either hand-crafted or learned as linear functions of fixed features. In this work, we demonstrate that it is possible to learn features for network-flow-based data association via backpropagation, by expressing the optimum of a smoothed network flow problem as a differentiable func"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08482","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":"1706.08482","created_at":"2026-05-18T00:41:42.491655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.08482v1","created_at":"2026-05-18T00:41:42.491655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08482","created_at":"2026-05-18T00:41:42.491655+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVRBLTGRCPQG","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVRBLTGRCPQGF44M","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVRBLTGR","created_at":"2026-05-18T12:31:49.984773+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/VVRBLTGRCPQGF44MZUEKLW7M2X","json":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X.json","graph_json":"https://pith.science/api/pith-number/VVRBLTGRCPQGF44MZUEKLW7M2X/graph.json","events_json":"https://pith.science/api/pith-number/VVRBLTGRCPQGF44MZUEKLW7M2X/events.json","paper":"https://pith.science/paper/VVRBLTGR"},"agent_actions":{"view_html":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X","download_json":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X.json","view_paper":"https://pith.science/paper/VVRBLTGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.08482&json=true","fetch_graph":"https://pith.science/api/pith-number/VVRBLTGRCPQGF44MZUEKLW7M2X/graph.json","fetch_events":"https://pith.science/api/pith-number/VVRBLTGRCPQGF44MZUEKLW7M2X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X/action/storage_attestation","attest_author":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X/action/author_attestation","sign_citation":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X/action/citation_signature","submit_replication":"https://pith.science/pith/VVRBLTGRCPQGF44MZUEKLW7M2X/action/replication_record"}},"created_at":"2026-05-18T00:41:42.491655+00:00","updated_at":"2026-05-18T00:41:42.491655+00:00"}