{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5ZQGWWUJM3OTKSKGAE4ZIUUIW4","short_pith_number":"pith:5ZQGWWUJ","schema_version":"1.0","canonical_sha256":"ee606b5a8966dd3549460139945288b703b8bd516db5dbb5dd18cadfb65cfafb","source":{"kind":"arxiv","id":"1603.01191","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.01191","created_at":"2026-05-18T00:45:35.009501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01191v3","created_at":"2026-05-18T00:45:35.009501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01191","created_at":"2026-05-18T00:45:35.009501+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZQGWWUJM3OT","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZQGWWUJM3OTKSKG","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZQGWWUJ","created_at":"2026-05-18T12:30:01.593930+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/5ZQGWWUJM3OTKSKGAE4ZIUUIW4","json":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4.json","graph_json":"https://pith.science/api/pith-number/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/graph.json","events_json":"https://pith.science/api/pith-number/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/events.json","paper":"https://pith.science/paper/5ZQGWWUJ"},"agent_actions":{"view_html":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4","download_json":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4.json","view_paper":"https://pith.science/paper/5ZQGWWUJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01191&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/action/storage_attestation","attest_author":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/action/author_attestation","sign_citation":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/action/citation_signature","submit_replication":"https://pith.science/pith/5ZQGWWUJM3OTKSKGAE4ZIUUIW4/action/replication_record"}},"created_at":"2026-05-18T00:45:35.009501+00:00","updated_at":"2026-05-18T00:45:35.009501+00:00"}