{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BDFIIBIHR53RSIMMRB5O4P4TRL","short_pith_number":"pith:BDFIIBIH","canonical_record":{"source":{"id":"1607.06317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-21T13:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"c49d92705b2814c0b79093b1807f8c668d4f61fc2fc46bc379eb1877f8a6c3ab","abstract_canon_sha256":"15bffe2b57996cf887b170e1c0c36e881928034f23ccfab07e6065d7819f7958"},"schema_version":"1.0"},"canonical_sha256":"08ca8405078f7719218c887aee3f938acedab49569d100a21ad9e2b12531d17e","source":{"kind":"arxiv","id":"1607.06317","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06317","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06317v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06317","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"BDFIIBIHR53R","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BDFIIBIHR53RSIMM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BDFIIBIH","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BDFIIBIHR53RSIMMRB5O4P4TRL","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-21T13:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"c49d92705b2814c0b79093b1807f8c668d4f61fc2fc46bc379eb1877f8a6c3ab","abstract_canon_sha256":"15bffe2b57996cf887b170e1c0c36e881928034f23ccfab07e6065d7819f7958"},"schema_version":"1.0"},"canonical_sha256":"08ca8405078f7719218c887aee3f938acedab49569d100a21ad9e2b12531d17e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.055374Z","signature_b64":"ipzz0r9bhGOhLq0gGdkfAwqumadzTZ2aCEKJE/1oykcZ2TnXXGhPZ/ZYbrv8gWi3utuVJm7JFjEvD3lgF6mNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08ca8405078f7719218c887aee3f938acedab49569d100a21ad9e2b12531d17e","last_reissued_at":"2026-05-18T01:10:42.054853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.054853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06317","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:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDDhFLDegY+VG9osoolXu9L8OdSKIGRzpI0QkjjXV+e/+VZee5mEW9sCX9xG2rgSZyaIlFomzIw004KO/RQCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:18:55.623793Z"},"content_sha256":"3b0afcde9dbe1ab5fac912d6968808d8463c7ccaac0473bd34e9cead5888a23a","schema_version":"1.0","event_id":"sha256:3b0afcde9dbe1ab5fac912d6968808d8463c7ccaac0473bd34e9cead5888a23a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BDFIIBIHR53RSIMMRB5O4P4TRL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-cut Formulation for Joint Segmentation and Tracking of Multiple Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bernt Schiele, Bjoern Andres, Margret Keuper, Siyu Tang, Thomas Brox, Yu Zhongjie","submitted_at":"2016-07-21T13:41:32Z","abstract_excerpt":"Recently, Minimum Cost Multicut Formulations have been proposed and proven to be successful in both motion trajectory segmentation and multi-target tracking scenarios. Both tasks benefit from decomposing a graphical model into an optimal number of connected components based on attractive and repulsive pairwise terms. The two tasks are formulated on different levels of granularity and, accordingly, leverage mostly local information for motion segmentation and mostly high-level information for multi-target tracking. In this paper we argue that point trajectories and their local relationships can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06317","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:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vsf/NDhJaSqU44XZnzCaBaZIlODyBXKXjzfF/hsz0GGhITIZR1LRAHwxutZ9Fh/W0UdRG/26dHcqNX8Fo7qaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T10:18:55.624142Z"},"content_sha256":"dfd93de0ac7c6f6854fa9c2cdb2d984fee47e860c85037a676151da06157fbda","schema_version":"1.0","event_id":"sha256:dfd93de0ac7c6f6854fa9c2cdb2d984fee47e860c85037a676151da06157fbda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDFIIBIHR53RSIMMRB5O4P4TRL/bundle.json","state_url":"https://pith.science/pith/BDFIIBIHR53RSIMMRB5O4P4TRL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDFIIBIHR53RSIMMRB5O4P4TRL/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-05-19T10:18:55Z","links":{"resolver":"https://pith.science/pith/BDFIIBIHR53RSIMMRB5O4P4TRL","bundle":"https://pith.science/pith/BDFIIBIHR53RSIMMRB5O4P4TRL/bundle.json","state":"https://pith.science/pith/BDFIIBIHR53RSIMMRB5O4P4TRL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDFIIBIHR53RSIMMRB5O4P4TRL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BDFIIBIHR53RSIMMRB5O4P4TRL","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":"15bffe2b57996cf887b170e1c0c36e881928034f23ccfab07e6065d7819f7958","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-21T13:41:32Z","title_canon_sha256":"c49d92705b2814c0b79093b1807f8c668d4f61fc2fc46bc379eb1877f8a6c3ab"},"schema_version":"1.0","source":{"id":"1607.06317","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06317","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06317v1","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06317","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"BDFIIBIHR53R","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BDFIIBIHR53RSIMM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BDFIIBIH","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:dfd93de0ac7c6f6854fa9c2cdb2d984fee47e860c85037a676151da06157fbda","target":"graph","created_at":"2026-05-18T01:10:42Z","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":"Recently, Minimum Cost Multicut Formulations have been proposed and proven to be successful in both motion trajectory segmentation and multi-target tracking scenarios. Both tasks benefit from decomposing a graphical model into an optimal number of connected components based on attractive and repulsive pairwise terms. The two tasks are formulated on different levels of granularity and, accordingly, leverage mostly local information for motion segmentation and mostly high-level information for multi-target tracking. In this paper we argue that point trajectories and their local relationships can","authors_text":"Bernt Schiele, Bjoern Andres, Margret Keuper, Siyu Tang, Thomas Brox, Yu Zhongjie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-21T13:41:32Z","title":"A Multi-cut Formulation for Joint Segmentation and Tracking of Multiple Objects"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06317","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:3b0afcde9dbe1ab5fac912d6968808d8463c7ccaac0473bd34e9cead5888a23a","target":"record","created_at":"2026-05-18T01:10:42Z","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":"15bffe2b57996cf887b170e1c0c36e881928034f23ccfab07e6065d7819f7958","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-21T13:41:32Z","title_canon_sha256":"c49d92705b2814c0b79093b1807f8c668d4f61fc2fc46bc379eb1877f8a6c3ab"},"schema_version":"1.0","source":{"id":"1607.06317","kind":"arxiv","version":1}},"canonical_sha256":"08ca8405078f7719218c887aee3f938acedab49569d100a21ad9e2b12531d17e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08ca8405078f7719218c887aee3f938acedab49569d100a21ad9e2b12531d17e","first_computed_at":"2026-05-18T01:10:42.054853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:42.054853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ipzz0r9bhGOhLq0gGdkfAwqumadzTZ2aCEKJE/1oykcZ2TnXXGhPZ/ZYbrv8gWi3utuVJm7JFjEvD3lgF6mNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:42.055374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06317","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b0afcde9dbe1ab5fac912d6968808d8463c7ccaac0473bd34e9cead5888a23a","sha256:dfd93de0ac7c6f6854fa9c2cdb2d984fee47e860c85037a676151da06157fbda"],"state_sha256":"4e64bcf6a129848202e3c4b88754ea1683c01d77f5ff98ff86a6fac7f149b6f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNYG8LdNvxVspbh0/NxiZsQddD0UMHIqJJrBSUy9VaAYataZXIO33KSeK0IRxiHILm4J9q9QVI2p7N19QY4/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T10:18:55.625804Z","bundle_sha256":"10e59ee0b6763cffb2941fc08b9822546d89ec747a5ee2f3f7d3393055a703d1"}}