{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SORDROKNGZ6TD5QQJ3YTQX4WB3","short_pith_number":"pith:SORDROKN","canonical_record":{"source":{"id":"1704.01811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-06T12:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"a3eb6d3d736c398d9e8738c69e172e6ff4be8097416903161f6edc3ca4278854","abstract_canon_sha256":"84e1c371e44b85e9eeddc5a6101094899c1df03717ccef2b595ecb8378790435"},"schema_version":"1.0"},"canonical_sha256":"93a238b94d367d31f6104ef1385f960ec4af9fe6f3415fbfd10254cb2be40cf6","source":{"kind":"arxiv","id":"1704.01811","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01811","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01811v2","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01811","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"SORDROKNGZ6T","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SORDROKNGZ6TD5QQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SORDROKN","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SORDROKNGZ6TD5QQJ3YTQX4WB3","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01811","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-06T12:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"a3eb6d3d736c398d9e8738c69e172e6ff4be8097416903161f6edc3ca4278854","abstract_canon_sha256":"84e1c371e44b85e9eeddc5a6101094899c1df03717ccef2b595ecb8378790435"},"schema_version":"1.0"},"canonical_sha256":"93a238b94d367d31f6104ef1385f960ec4af9fe6f3415fbfd10254cb2be40cf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:22.701382Z","signature_b64":"VvQIvGE1cPerDOXe7vLYzOzqH4kcoh5et+Fx8WeDGmMlgd7fNZ/j97s3oj/hemJH7h99HCQLYg1U8Q+j7lVMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a238b94d367d31f6104ef1385f960ec4af9fe6f3415fbfd10254cb2be40cf6","last_reissued_at":"2026-05-18T00:39:22.700635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:22.700635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01811","source_version":2,"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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2cHHpLRp1Z5XU1VpbOULVzVLNN4c+cPPSYm2jdhjzdjrVFpLFI12GBpfDA8pUUSQxRFVrPrGaxbBsu7mpzR9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:28:36.833058Z"},"content_sha256":"6ed5e92fde27185af3b2083f2041453249c03edca665efedd5eb59425d0a1f09","schema_version":"1.0","event_id":"sha256:6ed5e92fde27185af3b2083f2041453249c03edca665efedd5eb59425d0a1f09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SORDROKNGZ6TD5QQJ3YTQX4WB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Margret Keuper","submitted_at":"2017-04-06T12:55:11Z","abstract_excerpt":"Most state-of-the-art motion segmentation algorithms draw their potential from modeling motion differences of local entities such as point trajectories in terms of pairwise potentials in graphical models. Inference in instances of minimum cost multicut problems defined on such graphs al- lows to optimize the number of the resulting segments along with the segment assignment. However, pairwise potentials limit the discriminative power of the employed motion models to translational differences. More complex models such as Euclidean or affine transformations call for higher-order potentials and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01811","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":""},"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-18T00:39:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWJgpF43rFJw/Fabh2xVBUFPBbmKGjs9z8pEOmmuApf5TyVcJPaXZS4ee5Uwgsa6Z5JWSWivJ2/HWGMiz0vgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:28:36.833598Z"},"content_sha256":"79ab848f89fcea01485bedb3fa5e74e08fb7d2f3a97ced26f235f5145e5a9fb6","schema_version":"1.0","event_id":"sha256:79ab848f89fcea01485bedb3fa5e74e08fb7d2f3a97ced26f235f5145e5a9fb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3/bundle.json","state_url":"https://pith.science/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3/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-25T18:28:36Z","links":{"resolver":"https://pith.science/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3","bundle":"https://pith.science/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3/bundle.json","state":"https://pith.science/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SORDROKNGZ6TD5QQJ3YTQX4WB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SORDROKNGZ6TD5QQJ3YTQX4WB3","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":"84e1c371e44b85e9eeddc5a6101094899c1df03717ccef2b595ecb8378790435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-06T12:55:11Z","title_canon_sha256":"a3eb6d3d736c398d9e8738c69e172e6ff4be8097416903161f6edc3ca4278854"},"schema_version":"1.0","source":{"id":"1704.01811","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01811","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01811v2","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01811","created_at":"2026-05-18T00:39:22Z"},{"alias_kind":"pith_short_12","alias_value":"SORDROKNGZ6T","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SORDROKNGZ6TD5QQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SORDROKN","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:79ab848f89fcea01485bedb3fa5e74e08fb7d2f3a97ced26f235f5145e5a9fb6","target":"graph","created_at":"2026-05-18T00:39:22Z","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":"Most state-of-the-art motion segmentation algorithms draw their potential from modeling motion differences of local entities such as point trajectories in terms of pairwise potentials in graphical models. Inference in instances of minimum cost multicut problems defined on such graphs al- lows to optimize the number of the resulting segments along with the segment assignment. However, pairwise potentials limit the discriminative power of the employed motion models to translational differences. More complex models such as Euclidean or affine transformations call for higher-order potentials and a","authors_text":"Margret Keuper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-06T12:55:11Z","title":"Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01811","kind":"arxiv","version":2},"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:6ed5e92fde27185af3b2083f2041453249c03edca665efedd5eb59425d0a1f09","target":"record","created_at":"2026-05-18T00:39:22Z","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":"84e1c371e44b85e9eeddc5a6101094899c1df03717ccef2b595ecb8378790435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-06T12:55:11Z","title_canon_sha256":"a3eb6d3d736c398d9e8738c69e172e6ff4be8097416903161f6edc3ca4278854"},"schema_version":"1.0","source":{"id":"1704.01811","kind":"arxiv","version":2}},"canonical_sha256":"93a238b94d367d31f6104ef1385f960ec4af9fe6f3415fbfd10254cb2be40cf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93a238b94d367d31f6104ef1385f960ec4af9fe6f3415fbfd10254cb2be40cf6","first_computed_at":"2026-05-18T00:39:22.700635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:22.700635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VvQIvGE1cPerDOXe7vLYzOzqH4kcoh5et+Fx8WeDGmMlgd7fNZ/j97s3oj/hemJH7h99HCQLYg1U8Q+j7lVMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:22.701382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01811","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ed5e92fde27185af3b2083f2041453249c03edca665efedd5eb59425d0a1f09","sha256:79ab848f89fcea01485bedb3fa5e74e08fb7d2f3a97ced26f235f5145e5a9fb6"],"state_sha256":"d3d095532a8c1e49d68f22db44cb12afbc83c9f2e0f95d7f580a42b5a32a3d6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10n4Oo7UXaJjZZvYqJ2Pw9daCpjLm+hBu1Ylkke2Yt8eTK9W4hveQmONhBxu9WEjI7YMMhTG6yxDCGiajmI0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:28:36.837164Z","bundle_sha256":"3e285d5ecee45f5e7f578506a185a28acf24e6500df8135dad1f24864635a014"}}