{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YDHFLQWJTEISSVWEADDNS6BHF3","short_pith_number":"pith:YDHFLQWJ","schema_version":"1.0","canonical_sha256":"c0ce55c2c999112956c400c6d978272efff37561ff724deebcee3e513bd35e18","source":{"kind":"arxiv","id":"1607.02437","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02437","created_at":"2026-05-18T01:11:18.972093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02437v1","created_at":"2026-05-18T01:11:18.972093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02437","created_at":"2026-05-18T01:11:18.972093+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDHFLQWJTEIS","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDHFLQWJTEISSVWE","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDHFLQWJ","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3","json":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3.json","graph_json":"https://pith.science/api/pith-number/YDHFLQWJTEISSVWEADDNS6BHF3/graph.json","events_json":"https://pith.science/api/pith-number/YDHFLQWJTEISSVWEADDNS6BHF3/events.json","paper":"https://pith.science/paper/YDHFLQWJ"},"agent_actions":{"view_html":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3","download_json":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3.json","view_paper":"https://pith.science/paper/YDHFLQWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02437&json=true","fetch_graph":"https://pith.science/api/pith-number/YDHFLQWJTEISSVWEADDNS6BHF3/graph.json","fetch_events":"https://pith.science/api/pith-number/YDHFLQWJTEISSVWEADDNS6BHF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/action/storage_attestation","attest_author":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/action/author_attestation","sign_citation":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/action/citation_signature","submit_replication":"https://pith.science/pith/YDHFLQWJTEISSVWEADDNS6BHF3/action/replication_record"}},"created_at":"2026-05-18T01:11:18.972093+00:00","updated_at":"2026-05-18T01:11:18.972093+00:00"}