{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NFPPQBQ5ZSTEDGRWRIX5HGDPCP","short_pith_number":"pith:NFPPQBQ5","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"},"canonical_sha256":"695ef8061dcca6419a368a2fd3986f13e68847d70257634c22e3b9009aa0c53f","source":{"kind":"arxiv","id":"1610.01394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01394","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01394v1","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01394","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"NFPPQBQ5ZSTE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NFPPQBQ5ZSTEDGRW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NFPPQBQ5","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NFPPQBQ5ZSTEDGRWRIX5HGDPCP","target":"record","payload":{"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"},"canonical_sha256":"695ef8061dcca6419a368a2fd3986f13e68847d70257634c22e3b9009aa0c53f","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"},"source_kind":"arxiv","source_id":"1610.01394","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-18T01:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JgQAGTwEuZse7BDxsus6o7gQecrQwu5Nj3huc/Ijuo7AfayM11tp5dB+Dy9W13jIoDDH0SowVmbhLEa+a5JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:55:17.251146Z"},"content_sha256":"03d88733bf0d2a589d2740f2f42756b0ea502ec2a304a1dfd7ffd457e9c88949","schema_version":"1.0","event_id":"sha256:03d88733bf0d2a589d2740f2f42756b0ea502ec2a304a1dfd7ffd457e9c88949"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NFPPQBQ5ZSTEDGRWRIX5HGDPCP","target":"graph","payload":{"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"},"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-18T01:02:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFfPmrl/YzA/UitVUNe+6CutYppG2nZ4SY/QfyH1Wf3pjbTOvx1wjgxf3it93Q0KEJ97EmrMqb9xcITNnzCwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:55:17.251937Z"},"content_sha256":"f5746ab3da32e89e2bd5eaeda1afc46c8e4bfab7a9d284972c722eb9cd72ea9a","schema_version":"1.0","event_id":"sha256:f5746ab3da32e89e2bd5eaeda1afc46c8e4bfab7a9d284972c722eb9cd72ea9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/bundle.json","state_url":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/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-10T19:55:17Z","links":{"resolver":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP","bundle":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/bundle.json","state":"https://pith.science/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFPPQBQ5ZSTEDGRWRIX5HGDPCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NFPPQBQ5ZSTEDGRWRIX5HGDPCP","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":"18b9ea7094425069a909f26c8c536b760ba7fcd162059868560cb7c09e313916","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-05T13:04:48Z","title_canon_sha256":"314ec9cb3e210bcc0f5ec62581e27dd7899ff358bd528179ef14478d61af2ba5"},"schema_version":"1.0","source":{"id":"1610.01394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.01394","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1610.01394v1","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01394","created_at":"2026-05-18T01:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"NFPPQBQ5ZSTE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NFPPQBQ5ZSTEDGRW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NFPPQBQ5","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:f5746ab3da32e89e2bd5eaeda1afc46c8e4bfab7a9d284972c722eb9cd72ea9a","target":"graph","created_at":"2026-05-18T01:02:23Z","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":"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","authors_text":"Charless C. Fowlkes, Shaofei Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-05T13:04:48Z","title":"Learning Optimal Parameters for Multi-target Tracking with Contextual Interactions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01394","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:03d88733bf0d2a589d2740f2f42756b0ea502ec2a304a1dfd7ffd457e9c88949","target":"record","created_at":"2026-05-18T01:02:23Z","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":"18b9ea7094425069a909f26c8c536b760ba7fcd162059868560cb7c09e313916","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-10-05T13:04:48Z","title_canon_sha256":"314ec9cb3e210bcc0f5ec62581e27dd7899ff358bd528179ef14478d61af2ba5"},"schema_version":"1.0","source":{"id":"1610.01394","kind":"arxiv","version":1}},"canonical_sha256":"695ef8061dcca6419a368a2fd3986f13e68847d70257634c22e3b9009aa0c53f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"695ef8061dcca6419a368a2fd3986f13e68847d70257634c22e3b9009aa0c53f","first_computed_at":"2026-05-18T01:02:23.294176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:23.294176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bW0Sbzd+8ViZBQyKhoz7fyVOsHddtDXf3p8OpHlhytL9JZ33qLUlsRZaQzKsjm3NrhDtT8dUDp+ioxfFW7CnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:23.294815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.01394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03d88733bf0d2a589d2740f2f42756b0ea502ec2a304a1dfd7ffd457e9c88949","sha256:f5746ab3da32e89e2bd5eaeda1afc46c8e4bfab7a9d284972c722eb9cd72ea9a"],"state_sha256":"24aa48003e7721db3e516c413581670aa33d99f006039d5ceb4a726ed1f328d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgVcNtgDAS9nJbpgPKg9hO42jVT6KmxXz1mv0/jO/q7rUpW/vJHt2Rw9M3IDhPUlr7/Dp0jTIKPImY41hAzNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:55:17.256043Z","bundle_sha256":"a640a5224fd784cb4b71b9a8e8fd347d6d19d8445ba774a35efb7fdd158ff57e"}}