{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5ZQGWWUJM3OTKSKGAE4ZIUUIW4","short_pith_number":"pith:5ZQGWWUJ","canonical_record":{"source":{"id":"1603.01191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-03T17:29:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"004b374d42636bdaab9e976c154ca690927dcc0c95aae311bf877239ed320be1","abstract_canon_sha256":"6862cf92f377c4890151209261de98d07353732018efae88d4bae5c18b069d4f"},"schema_version":"1.0"},"canonical_sha256":"ee606b5a8966dd3549460139945288b703b8bd516db5dbb5dd18cadfb65cfafb","source":{"kind":"arxiv","id":"1603.01191","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01191","created_at":"2026-05-18T00:45:35Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01191v3","created_at":"2026-05-18T00:45:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01191","created_at":"2026-05-18T00:45:35Z"},{"alias_kind":"pith_short_12","alias_value":"5ZQGWWUJM3OT","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ZQGWWUJM3OTKSKG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ZQGWWUJ","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5ZQGWWUJM3OTKSKGAE4ZIUUIW4","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01191","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-03T17:29:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"004b374d42636bdaab9e976c154ca690927dcc0c95aae311bf877239ed320be1","abstract_canon_sha256":"6862cf92f377c4890151209261de98d07353732018efae88d4bae5c18b069d4f"},"schema_version":"1.0"},"canonical_sha256":"ee606b5a8966dd3549460139945288b703b8bd516db5dbb5dd18cadfb65cfafb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:35.010085Z","signature_b64":"PundHOn3rEVVJVimsOcvNixpZjSIP8XoYjEOh7iJlPsv1d2UcBcjiE0PO5Z0FqkJtkHDgAFC5mipCxBiVh2tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee606b5a8966dd3549460139945288b703b8bd516db5dbb5dd18cadfb65cfafb","last_reissued_at":"2026-05-18T00:45:35.009419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:35.009419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01191","source_version":3,"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:45:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hvctvWVDVNYNN1m0GWK9TfKLwF+AkqlmHXd9rVf27Tyw4uHwKzc0ufVXfWnnjbXlEZ0a2ODYmUczcbwSc681Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:02:45.938329Z"},"content_sha256":"167fcc80af64d153dbea57d4e3c9a02eba45fa1114365a88814bcd1ffdf2f366","schema_version":"1.0","event_id":"sha256:167fcc80af64d153dbea57d4e3c9a02eba45fa1114365a88814bcd1ffdf2f366"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5ZQGWWUJM3OTKSKGAE4ZIUUIW4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Artem V. Pyatkin, Ren\\'e van Bevern","submitted_at":"2016-03-03T17:29:49Z","abstract_excerpt":"The open shop problem is to find a minimum makespan schedule to process each job $J_i$ on each machine $M_q$ for $p_{iq}$ time such that, at any time, each machine processes at most one job and each job is processed by at most one machine. We study a problem variant in which the jobs are located in the vertices of an edge-weighted graph. The weights determine the time needed for the machines to travel between jobs in different vertices. We show that the problem with $m$ machines and $n$ unit-time jobs in $g$ vertices is solvable in $2^{O(gm^2\\log gm)}+O(mn\\log n)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01191","kind":"arxiv","version":3},"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:45:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSTWBgIISBx60bwaL0qyXmto9XRVvYpnozVSLaNWcZxdknfwUGBOPSWZZfypZuAk1rmIh4fLUs9G4zWdqvchBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:02:45.938795Z"},"content_sha256":"3ead7eb43697f3ab57def7e219d397e5955eb5e4d0e941ee0739a399d244a9cc","schema_version":"1.0","event_id":"sha256:3ead7eb43697f3ab57def7e219d397e5955eb5e4d0e941ee0739a399d244a9cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/bundle.json","state_url":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/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-30T17:02:45Z","links":{"resolver":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4","bundle":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/bundle.json","state":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5ZQGWWUJM3OTKSKGAE4ZIUUIW4","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":"6862cf92f377c4890151209261de98d07353732018efae88d4bae5c18b069d4f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-03T17:29:49Z","title_canon_sha256":"004b374d42636bdaab9e976c154ca690927dcc0c95aae311bf877239ed320be1"},"schema_version":"1.0","source":{"id":"1603.01191","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01191","created_at":"2026-05-18T00:45:35Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01191v3","created_at":"2026-05-18T00:45:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01191","created_at":"2026-05-18T00:45:35Z"},{"alias_kind":"pith_short_12","alias_value":"5ZQGWWUJM3OT","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5ZQGWWUJM3OTKSKG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5ZQGWWUJ","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:3ead7eb43697f3ab57def7e219d397e5955eb5e4d0e941ee0739a399d244a9cc","target":"graph","created_at":"2026-05-18T00:45:35Z","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":"The open shop problem is to find a minimum makespan schedule to process each job $J_i$ on each machine $M_q$ for $p_{iq}$ time such that, at any time, each machine processes at most one job and each job is processed by at most one machine. We study a problem variant in which the jobs are located in the vertices of an edge-weighted graph. The weights determine the time needed for the machines to travel between jobs in different vertices. We show that the problem with $m$ machines and $n$ unit-time jobs in $g$ vertices is solvable in $2^{O(gm^2\\log gm)}+O(mn\\log n)$ time.","authors_text":"Artem V. Pyatkin, Ren\\'e van Bevern","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-03T17:29:49Z","title":"A fixed-parameter algorithm for a routing open shop problem: unit processing times, few machines and locations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01191","kind":"arxiv","version":3},"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:167fcc80af64d153dbea57d4e3c9a02eba45fa1114365a88814bcd1ffdf2f366","target":"record","created_at":"2026-05-18T00:45:35Z","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":"6862cf92f377c4890151209261de98d07353732018efae88d4bae5c18b069d4f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-03T17:29:49Z","title_canon_sha256":"004b374d42636bdaab9e976c154ca690927dcc0c95aae311bf877239ed320be1"},"schema_version":"1.0","source":{"id":"1603.01191","kind":"arxiv","version":3}},"canonical_sha256":"ee606b5a8966dd3549460139945288b703b8bd516db5dbb5dd18cadfb65cfafb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee606b5a8966dd3549460139945288b703b8bd516db5dbb5dd18cadfb65cfafb","first_computed_at":"2026-05-18T00:45:35.009419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:35.009419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PundHOn3rEVVJVimsOcvNixpZjSIP8XoYjEOh7iJlPsv1d2UcBcjiE0PO5Z0FqkJtkHDgAFC5mipCxBiVh2tAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:35.010085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01191","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:167fcc80af64d153dbea57d4e3c9a02eba45fa1114365a88814bcd1ffdf2f366","sha256:3ead7eb43697f3ab57def7e219d397e5955eb5e4d0e941ee0739a399d244a9cc"],"state_sha256":"d944b2962270f288c3ee3bcd6f86595114ce01a85ece88fbb4c11f7f6fd0f9e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrRZp+LE+kXRBQv1XUw87b/b5LrdGB6uZ5YY3rFfnzBzKso1rRVrR0rUTWK9V63dm8sZs9327vUujJPkjlsAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:02:45.941647Z","bundle_sha256":"f2f49a7fd33610538eb7656c9fde095bf903dad13306f70b8e1b7481b02b9d22"}}