{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YDHFLQWJTEISSVWEADDNS6BHF3","short_pith_number":"pith:YDHFLQWJ","canonical_record":{"source":{"id":"1607.02437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-08T16:17:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"32ad8f12d9ee1fd5f130f14366ffb5fe57189b5839d82da1aeb4b97eae5ba6e7","abstract_canon_sha256":"c500cb05f7bb6a83569b4c8c0f3c060b2f265fdc7829f1106f017158e9c2fe65"},"schema_version":"1.0"},"canonical_sha256":"c0ce55c2c999112956c400c6d978272efff37561ff724deebcee3e513bd35e18","source":{"kind":"arxiv","id":"1607.02437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02437","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02437v1","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02437","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"YDHFLQWJTEIS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDHFLQWJTEISSVWE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDHFLQWJ","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YDHFLQWJTEISSVWEADDNS6BHF3","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-08T16:17:42Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"32ad8f12d9ee1fd5f130f14366ffb5fe57189b5839d82da1aeb4b97eae5ba6e7","abstract_canon_sha256":"c500cb05f7bb6a83569b4c8c0f3c060b2f265fdc7829f1106f017158e9c2fe65"},"schema_version":"1.0"},"canonical_sha256":"c0ce55c2c999112956c400c6d978272efff37561ff724deebcee3e513bd35e18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:18.972551Z","signature_b64":"aWB77S441mHYDRg5KhN3BiSrP1jgUpTM1AI0Iyi2ZaWrNiFwO0ika8KaOnEx9VgVWwQYezkeB8SletoRg2HoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ce55c2c999112956c400c6d978272efff37561ff724deebcee3e513bd35e18","last_reissued_at":"2026-05-18T01:11:18.972007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:18.972007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02437","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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOvIYkIWTHm1vn1cI3ZaeCIMGAuJxHPBGfshZDRIlOx9uqt9yPFtNE1HJxghyJI8IMOb2C3gL1t5n3rn6tWJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:45:45.284607Z"},"content_sha256":"e0ccd4788208b59c132b60484ee6f604d6aea78d6fd42229fdc57c843236e64c","schema_version":"1.0","event_id":"sha256:e0ccd4788208b59c132b60484ee6f604d6aea78d6fd42229fdc57c843236e64c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YDHFLQWJTEISSVWEADDNS6BHF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Assignments via Ear Decompositions and Randomized Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"David Adjiashvili, Dennis Michaels, Viktor Bindewald","submitted_at":"2016-07-08T16:17:42Z","abstract_excerpt":"Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned to the available set of machines or personnel (resources), in a way that all tasks have assigned resources, and no two tasks share the same resource. In its nominal form, the resulting computational problem becomes the \\emph{assignment problem} on general bipartite graphs.\n  This paper deals with a robust variant of the assignment problem modeling situations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02437","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:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ErywMMeRhMjn5Y7CbMtqRSV4fKsomh4xrZkrsOGZKv4PGogZieFcTQbu4nXjAlDJp0KdHS7h9B1xzGoRLRuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T16:45:45.284955Z"},"content_sha256":"66225db9677f11a8cf9d9d4b4f4831e4ec01c257d81975c00938a9eb403d5006","schema_version":"1.0","event_id":"sha256:66225db9677f11a8cf9d9d4b4f4831e4ec01c257d81975c00938a9eb403d5006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/bundle.json","state_url":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDHFLQWJTEISSVWEADDNS6BHF3/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-22T16:45:45Z","links":{"resolver":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3","bundle":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/bundle.json","state":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDHFLQWJTEISSVWEADDNS6BHF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YDHFLQWJTEISSVWEADDNS6BHF3","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":"c500cb05f7bb6a83569b4c8c0f3c060b2f265fdc7829f1106f017158e9c2fe65","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-08T16:17:42Z","title_canon_sha256":"32ad8f12d9ee1fd5f130f14366ffb5fe57189b5839d82da1aeb4b97eae5ba6e7"},"schema_version":"1.0","source":{"id":"1607.02437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02437","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02437v1","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02437","created_at":"2026-05-18T01:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"YDHFLQWJTEIS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YDHFLQWJTEISSVWE","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YDHFLQWJ","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:66225db9677f11a8cf9d9d4b4f4831e4ec01c257d81975c00938a9eb403d5006","target":"graph","created_at":"2026-05-18T01:11: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":"Many real-life planning problems require making a priori decisions before all parameters of the problem have been revealed. An important special case of such problem arises in scheduling problems, where a set of tasks needs to be assigned to the available set of machines or personnel (resources), in a way that all tasks have assigned resources, and no two tasks share the same resource. In its nominal form, the resulting computational problem becomes the \\emph{assignment problem} on general bipartite graphs.\n  This paper deals with a robust variant of the assignment problem modeling situations ","authors_text":"David Adjiashvili, Dennis Michaels, Viktor Bindewald","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-08T16:17:42Z","title":"Robust Assignments via Ear Decompositions and Randomized Rounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02437","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:e0ccd4788208b59c132b60484ee6f604d6aea78d6fd42229fdc57c843236e64c","target":"record","created_at":"2026-05-18T01:11: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":"c500cb05f7bb6a83569b4c8c0f3c060b2f265fdc7829f1106f017158e9c2fe65","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-08T16:17:42Z","title_canon_sha256":"32ad8f12d9ee1fd5f130f14366ffb5fe57189b5839d82da1aeb4b97eae5ba6e7"},"schema_version":"1.0","source":{"id":"1607.02437","kind":"arxiv","version":1}},"canonical_sha256":"c0ce55c2c999112956c400c6d978272efff37561ff724deebcee3e513bd35e18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0ce55c2c999112956c400c6d978272efff37561ff724deebcee3e513bd35e18","first_computed_at":"2026-05-18T01:11:18.972007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:18.972007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aWB77S441mHYDRg5KhN3BiSrP1jgUpTM1AI0Iyi2ZaWrNiFwO0ika8KaOnEx9VgVWwQYezkeB8SletoRg2HoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:18.972551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ccd4788208b59c132b60484ee6f604d6aea78d6fd42229fdc57c843236e64c","sha256:66225db9677f11a8cf9d9d4b4f4831e4ec01c257d81975c00938a9eb403d5006"],"state_sha256":"b50f022dfc1774d13e761ebe635d194d83f7b70e746a8fde3a3f162a78f6fdb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eInicj6yC57v8F1865fFnzVXEeH0TAYDSvhHBE+DwZFWwzK6Z7jf7btEa67A0QSzL+A7gDwRoSw3WLBnmq9WDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T16:45:45.287075Z","bundle_sha256":"5bb06140596a837b779312e338282fb93f8c49d51c08dca5bd3c63a56ce5b8b2"}}