{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NFPPQBQ5ZSTEDGRWRIX5HGDPCP","short_pith_number":"pith:NFPPQBQ5","schema_version":"1.0","canonical_sha256":"695ef8061dcca6419a368a2fd3986f13e68847d70257634c22e3b9009aa0c53f","source":{"kind":"arxiv","id":"1610.01394","version":1},"attestation_state":"computed","paper":{"title":"Learning Optimal Parameters for Multi-target Tracking with Contextual Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Charless C. Fowlkes, Shaofei Wang","submitted_at":"2016-10-05T13:04:48Z","abstract_excerpt":"We describe an end-to-end framework for learning parameters of min-cost flow multi-target tracking problem with quadratic trajectory interactions including suppression of overlapping tracks and contextual cues about cooccurrence of different objects. Our approach utilizes structured prediction with a tracking-specific loss function to learn the complete set of model parameters. In this learning framework, we evaluate two different approaches to finding an optimal set of tracks under a quadratic model objective, one based on an LP relaxation and the other based on novel greedy variants of dynam"},"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":"1610.01394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-05T13:04:48Z","cross_cats_sorted":[],"title_canon_sha256":"314ec9cb3e210bcc0f5ec62581e27dd7899ff358bd528179ef14478d61af2ba5","abstract_canon_sha256":"18b9ea7094425069a909f26c8c536b760ba7fcd162059868560cb7c09e313916"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:23.294815Z","signature_b64":"bW0Sbzd+8ViZBQyKhoz7fyVOsHddtDXf3p8OpHlhytL9JZ33qLUlsRZaQzKsjm3NrhDtT8dUDp+ioxfFW7CnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"695ef8061dcca6419a368a2fd3986f13e68847d70257634c22e3b9009aa0c53f","last_reissued_at":"2026-05-18T01:02:23.294176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:23.294176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Optimal Parameters for Multi-target Tracking with Contextual Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Charless C. Fowlkes, Shaofei Wang","submitted_at":"2016-10-05T13:04:48Z","abstract_excerpt":"We describe an end-to-end framework for learning parameters of min-cost flow multi-target tracking problem with quadratic trajectory interactions including suppression of overlapping tracks and contextual cues about cooccurrence of different objects. Our approach utilizes structured prediction with a tracking-specific loss function to learn the complete set of model parameters. In this learning framework, we evaluate two different approaches to finding an optimal set of tracks under a quadratic model objective, one based on an LP relaxation and the other based on novel greedy variants of dynam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01394","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":"1610.01394","created_at":"2026-05-18T01:02:23.294261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01394v1","created_at":"2026-05-18T01:02:23.294261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01394","created_at":"2026-05-18T01:02:23.294261+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFPPQBQ5ZSTE","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFPPQBQ5ZSTEDGRW","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFPPQBQ5","created_at":"2026-05-18T12:30:32.724797+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/NFPPQBQ5ZSTEDGRWRIX5HGDPCP","json":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP.json","graph_json":"https://pith.science/api/pith-number/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/graph.json","events_json":"https://pith.science/api/pith-number/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/events.json","paper":"https://pith.science/paper/NFPPQBQ5"},"agent_actions":{"view_html":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP","download_json":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP.json","view_paper":"https://pith.science/paper/NFPPQBQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01394&json=true","fetch_graph":"https://pith.science/api/pith-number/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/graph.json","fetch_events":"https://pith.science/api/pith-number/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/action/storage_attestation","attest_author":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/action/author_attestation","sign_citation":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/action/citation_signature","submit_replication":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/action/replication_record"}},"created_at":"2026-05-18T01:02:23.294261+00:00","updated_at":"2026-05-18T01:02:23.294261+00:00"}