{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NZNA2HMEZXASTCUFW2GLKYTTIC","short_pith_number":"pith:NZNA2HME","canonical_record":{"source":{"id":"1611.04399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-14T14:48:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b4ce6a6b7568743a0c0ea760e4dc066cfcf79c923091df9de7431f2ae5cfa852","abstract_canon_sha256":"986e19e38abd1176b7fcd8e7db43eb0585c3a98e1ed5c6a6eedb762de67b87ea"},"schema_version":"1.0"},"canonical_sha256":"6e5a0d1d84cdc1298a85b68cb562734080e0ad3c6d4128db6024a684f71c5df9","source":{"kind":"arxiv","id":"1611.04399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04399","created_at":"2026-05-18T00:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04399v2","created_at":"2026-05-18T00:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04399","created_at":"2026-05-18T00:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"NZNA2HMEZXAS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NZNA2HMEZXASTCUF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NZNA2HME","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NZNA2HMEZXASTCUFW2GLKYTTIC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-14T14:48:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b4ce6a6b7568743a0c0ea760e4dc066cfcf79c923091df9de7431f2ae5cfa852","abstract_canon_sha256":"986e19e38abd1176b7fcd8e7db43eb0585c3a98e1ed5c6a6eedb762de67b87ea"},"schema_version":"1.0"},"canonical_sha256":"6e5a0d1d84cdc1298a85b68cb562734080e0ad3c6d4128db6024a684f71c5df9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:18.223021Z","signature_b64":"0S/OWisiyrZw19y0FBzsSUWtKOhIYjW2f+QlgCPxlUU5EiaRDSwrMfOy4+XOf9sMdlmzVFGdyzj8PQ9nE2LZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e5a0d1d84cdc1298a85b68cb562734080e0ad3c6d4128db6024a684f71c5df9","last_reissued_at":"2026-05-18T00:50:18.222532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:18.222532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04399","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:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NX09P+HE7WrkoonYlMvhEcFjReNBWnGcIw2tGJDNCXzuRkpKctXew0EghY/s1UGXniggtDKU1AAQBK96FLJgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:41:28.271191Z"},"content_sha256":"37229a1ca462f26b08f608ba43f8fbc64acfb69bf95de9b932497cd2ef9f6b0e","schema_version":"1.0","event_id":"sha256:37229a1ca462f26b08f608ba43f8fbc64acfb69bf95de9b932497cd2ef9f6b0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NZNA2HMEZXASTCUFW2GLKYTTIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CV","authors_text":"Alexander Kirillov, Bernt Schiele, Bjoern Andres, Carsten Rother, Eldar Insafutdinov, Evgeny Levinkov, Jonas Uhrig, Mohamed Omran, Siyu Tang, Thomas Brox","submitted_at":"2016-11-14T14:48:38Z","abstract_excerpt":"We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks, including instance-separating semantic segmentation, articulated human body pose estimation and multiple object tracking. Conceptually, the problem we state generalizes the unconstrained integer quadratic program and the minimum cost lifted multicut problem, both of which are NP-hard. In order to find feasible solutions efficiently, we define two local search a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04399","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:50:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGC87wb5BWciplLuQAYPJ2kYt9gCadGwaLz4Wr85pDk3Z/gHMWhdv2eZAWRCCuUhvPfHq66BPvHGeDHMMk/9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:41:28.271773Z"},"content_sha256":"ce0b20bddd06586d9388177f3bd284446a8a7be6ec2a60134ec1bed57db0a414","schema_version":"1.0","event_id":"sha256:ce0b20bddd06586d9388177f3bd284446a8a7be6ec2a60134ec1bed57db0a414"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZNA2HMEZXASTCUFW2GLKYTTIC/bundle.json","state_url":"https://pith.science/pith/NZNA2HMEZXASTCUFW2GLKYTTIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZNA2HMEZXASTCUFW2GLKYTTIC/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-27T20:41:28Z","links":{"resolver":"https://pith.science/pith/NZNA2HMEZXASTCUFW2GLKYTTIC","bundle":"https://pith.science/pith/NZNA2HMEZXASTCUFW2GLKYTTIC/bundle.json","state":"https://pith.science/pith/NZNA2HMEZXASTCUFW2GLKYTTIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZNA2HMEZXASTCUFW2GLKYTTIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NZNA2HMEZXASTCUFW2GLKYTTIC","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":"986e19e38abd1176b7fcd8e7db43eb0585c3a98e1ed5c6a6eedb762de67b87ea","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-14T14:48:38Z","title_canon_sha256":"b4ce6a6b7568743a0c0ea760e4dc066cfcf79c923091df9de7431f2ae5cfa852"},"schema_version":"1.0","source":{"id":"1611.04399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04399","created_at":"2026-05-18T00:50:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04399v2","created_at":"2026-05-18T00:50:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04399","created_at":"2026-05-18T00:50:18Z"},{"alias_kind":"pith_short_12","alias_value":"NZNA2HMEZXAS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NZNA2HMEZXASTCUF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NZNA2HME","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ce0b20bddd06586d9388177f3bd284446a8a7be6ec2a60134ec1bed57db0a414","target":"graph","created_at":"2026-05-18T00:50:18Z","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 state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks, including instance-separating semantic segmentation, articulated human body pose estimation and multiple object tracking. Conceptually, the problem we state generalizes the unconstrained integer quadratic program and the minimum cost lifted multicut problem, both of which are NP-hard. In order to find feasible solutions efficiently, we define two local search a","authors_text":"Alexander Kirillov, Bernt Schiele, Bjoern Andres, Carsten Rother, Eldar Insafutdinov, Evgeny Levinkov, Jonas Uhrig, Mohamed Omran, Siyu Tang, Thomas Brox","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-14T14:48:38Z","title":"Joint Graph Decomposition and Node Labeling: Problem, Algorithms, Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04399","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:37229a1ca462f26b08f608ba43f8fbc64acfb69bf95de9b932497cd2ef9f6b0e","target":"record","created_at":"2026-05-18T00:50:18Z","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":"986e19e38abd1176b7fcd8e7db43eb0585c3a98e1ed5c6a6eedb762de67b87ea","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-14T14:48:38Z","title_canon_sha256":"b4ce6a6b7568743a0c0ea760e4dc066cfcf79c923091df9de7431f2ae5cfa852"},"schema_version":"1.0","source":{"id":"1611.04399","kind":"arxiv","version":2}},"canonical_sha256":"6e5a0d1d84cdc1298a85b68cb562734080e0ad3c6d4128db6024a684f71c5df9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e5a0d1d84cdc1298a85b68cb562734080e0ad3c6d4128db6024a684f71c5df9","first_computed_at":"2026-05-18T00:50:18.222532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:18.222532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0S/OWisiyrZw19y0FBzsSUWtKOhIYjW2f+QlgCPxlUU5EiaRDSwrMfOy4+XOf9sMdlmzVFGdyzj8PQ9nE2LZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:18.223021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37229a1ca462f26b08f608ba43f8fbc64acfb69bf95de9b932497cd2ef9f6b0e","sha256:ce0b20bddd06586d9388177f3bd284446a8a7be6ec2a60134ec1bed57db0a414"],"state_sha256":"b18dfc25e952607dabff3d3ec850cf2a331c7ecaa60dbed7bbb22888a9c0eebc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CViMjn8dtB7vZcAzLwx0zJ8s2NJFB1IZmwKbXOYIg4jhhh3ofmCKU2155DbPdAsSnCu3QcG9LaasIjqNEU/VDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:41:28.275674Z","bundle_sha256":"bd1bf4c799bdb26eb4cad1ed6fc5674902240cab8ccaef1aa5c7234d42146ada"}}