{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WV4HOI7BXGMINX4NA24UCTVW5V","short_pith_number":"pith:WV4HOI7B","canonical_record":{"source":{"id":"1703.06074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T16:18:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4d7371a2f5f9b3001aec0b476281c5679e47dc161ca564b655b4248f675b1d1f","abstract_canon_sha256":"a0c90fae9e37d85ab7c75395d5d4aeb7dc2643eb970a93c4fe37e4dcfb2d1edf"},"schema_version":"1.0"},"canonical_sha256":"b5787723e1b99886df8d06b9414eb6ed72c55c67573b2ce81b96f68fb9306715","source":{"kind":"arxiv","id":"1703.06074","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06074","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06074v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06074","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"WV4HOI7BXGMI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WV4HOI7BXGMINX4N","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WV4HOI7B","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WV4HOI7BXGMINX4NA24UCTVW5V","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T16:18:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4d7371a2f5f9b3001aec0b476281c5679e47dc161ca564b655b4248f675b1d1f","abstract_canon_sha256":"a0c90fae9e37d85ab7c75395d5d4aeb7dc2643eb970a93c4fe37e4dcfb2d1edf"},"schema_version":"1.0"},"canonical_sha256":"b5787723e1b99886df8d06b9414eb6ed72c55c67573b2ce81b96f68fb9306715","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.548506Z","signature_b64":"zwO1WBlCeNLD8v68Ovm9kdJbGDZV+83FWRqmGg5GFlcGP9fStci7m+z17GTDnwVkUfRpcCIDREACuohm7q5FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5787723e1b99886df8d06b9414eb6ed72c55c67573b2ce81b96f68fb9306715","last_reissued_at":"2026-05-18T00:48:29.547798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.547798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06074","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-18T00:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIdKMvB3K1TcQu41zu9zDwq2M9XPsHpGqP+UG6M01E7dnt0r6h0kYQb12QcODDUbr2HSPsMltvddEvvPrBn5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:53:58.097396Z"},"content_sha256":"a3de5aa104a5504f29c6e92b897a321c1a33b85506062d72d224c26c8c89741e","schema_version":"1.0","event_id":"sha256:a3de5aa104a5504f29c6e92b897a321c1a33b85506062d72d224c26c8c89741e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WV4HOI7BXGMINX4NA24UCTVW5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Assignments with Vulnerable Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"David Adjiashvili, Dennis Michaels, Viktor Bindewald","submitted_at":"2017-03-17T16:18:31Z","abstract_excerpt":"Various real-life planning problems require making upfront decisions before all parameters of the problem have been disclosed. An important special case of such problem especially arises in scheduling and staff rostering problems, where a set of tasks needs to be assigned to an available set of resources (personnel or machines), in a way that each task is assigned to one resource, while no task is allowed to share a resource with another task. In its nominal form, the resulting computational problem reduces to the well-known assignment problem that can be modeled as matching problems on bipart"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06074","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-18T00:48:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSA+M0Z3a/WVneG/PeiigQ63piPr1yXEPIc45pOp9Q0mBMnwekd4Ax3I5l7QoZN9VUS6QMEYvEC7JdFjNH0TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:53:58.097756Z"},"content_sha256":"7fb3a17887b49e1a2b76d1a6e317231c5205c6cb4a0e6815a7359ddb80bc8900","schema_version":"1.0","event_id":"sha256:7fb3a17887b49e1a2b76d1a6e317231c5205c6cb4a0e6815a7359ddb80bc8900"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WV4HOI7BXGMINX4NA24UCTVW5V/bundle.json","state_url":"https://pith.science/pith/WV4HOI7BXGMINX4NA24UCTVW5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WV4HOI7BXGMINX4NA24UCTVW5V/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-22T04:53:58Z","links":{"resolver":"https://pith.science/pith/WV4HOI7BXGMINX4NA24UCTVW5V","bundle":"https://pith.science/pith/WV4HOI7BXGMINX4NA24UCTVW5V/bundle.json","state":"https://pith.science/pith/WV4HOI7BXGMINX4NA24UCTVW5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WV4HOI7BXGMINX4NA24UCTVW5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WV4HOI7BXGMINX4NA24UCTVW5V","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":"a0c90fae9e37d85ab7c75395d5d4aeb7dc2643eb970a93c4fe37e4dcfb2d1edf","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T16:18:31Z","title_canon_sha256":"4d7371a2f5f9b3001aec0b476281c5679e47dc161ca564b655b4248f675b1d1f"},"schema_version":"1.0","source":{"id":"1703.06074","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06074","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06074v1","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06074","created_at":"2026-05-18T00:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"WV4HOI7BXGMI","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WV4HOI7BXGMINX4N","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WV4HOI7B","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:7fb3a17887b49e1a2b76d1a6e317231c5205c6cb4a0e6815a7359ddb80bc8900","target":"graph","created_at":"2026-05-18T00:48:29Z","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":"Various real-life planning problems require making upfront decisions before all parameters of the problem have been disclosed. An important special case of such problem especially arises in scheduling and staff rostering problems, where a set of tasks needs to be assigned to an available set of resources (personnel or machines), in a way that each task is assigned to one resource, while no task is allowed to share a resource with another task. In its nominal form, the resulting computational problem reduces to the well-known assignment problem that can be modeled as matching problems on bipart","authors_text":"David Adjiashvili, Dennis Michaels, Viktor Bindewald","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T16:18:31Z","title":"Robust Assignments with Vulnerable Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06074","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:a3de5aa104a5504f29c6e92b897a321c1a33b85506062d72d224c26c8c89741e","target":"record","created_at":"2026-05-18T00:48:29Z","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":"a0c90fae9e37d85ab7c75395d5d4aeb7dc2643eb970a93c4fe37e4dcfb2d1edf","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-17T16:18:31Z","title_canon_sha256":"4d7371a2f5f9b3001aec0b476281c5679e47dc161ca564b655b4248f675b1d1f"},"schema_version":"1.0","source":{"id":"1703.06074","kind":"arxiv","version":1}},"canonical_sha256":"b5787723e1b99886df8d06b9414eb6ed72c55c67573b2ce81b96f68fb9306715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5787723e1b99886df8d06b9414eb6ed72c55c67573b2ce81b96f68fb9306715","first_computed_at":"2026-05-18T00:48:29.547798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:29.547798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwO1WBlCeNLD8v68Ovm9kdJbGDZV+83FWRqmGg5GFlcGP9fStci7m+z17GTDnwVkUfRpcCIDREACuohm7q5FDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:29.548506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06074","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3de5aa104a5504f29c6e92b897a321c1a33b85506062d72d224c26c8c89741e","sha256:7fb3a17887b49e1a2b76d1a6e317231c5205c6cb4a0e6815a7359ddb80bc8900"],"state_sha256":"b75321ee7d018ed62b50347c2fd567ace944b12b51e87652ab5ca64522f33a2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06TFpa/TbAalIhkeIsFrLMVx74JbHLQBbVMt0U1sez6/zCYzLWmaX3XysCcBb/7BjhhQalovpnEkUaT6SME3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:53:58.100036Z","bundle_sha256":"f40246574dffd4e502d198974c79da594b6858189678041fba43c44b490daa0a"}}