{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GB4SFODHVF7TVM5OEERW5DD4MG","short_pith_number":"pith:GB4SFODH","canonical_record":{"source":{"id":"1108.0810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-03T10:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"a98b64da38ed8876bd273cce4c5e4777d908a3414ac605fcbdc230b99282230a","abstract_canon_sha256":"8f9ee0b2f70b9b524659401d7addfd76b2ea0edb7182e1c809a4cbb2a2ad9842"},"schema_version":"1.0"},"canonical_sha256":"307922b867a97f3ab3ae21236e8c7c619ea09f35120a792e044e04770302d136","source":{"kind":"arxiv","id":"1108.0810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0810","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0810v2","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0810","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"GB4SFODHVF7T","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GB4SFODHVF7TVM5O","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GB4SFODH","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GB4SFODHVF7TVM5OEERW5DD4MG","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-03T10:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"a98b64da38ed8876bd273cce4c5e4777d908a3414ac605fcbdc230b99282230a","abstract_canon_sha256":"8f9ee0b2f70b9b524659401d7addfd76b2ea0edb7182e1c809a4cbb2a2ad9842"},"schema_version":"1.0"},"canonical_sha256":"307922b867a97f3ab3ae21236e8c7c619ea09f35120a792e044e04770302d136","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.972049Z","signature_b64":"BVXf4XJFyQeYYZ3MPnOZ4kVrzcFVqVhJ3Rwm9QQvB7YPf65mo5lPM5Pw6HFEV0bZU/KJBm/Y2Z7nZ1+suT6eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307922b867a97f3ab3ae21236e8c7c619ea09f35120a792e044e04770302d136","last_reissued_at":"2026-05-18T03:52:14.971275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.971275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0810","source_version":2,"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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbAYDYN+6FZQc6pSHIfWMdfdZPW5WnBY7QNSR3PZd1ARbH6goJw37LojF9Fnp9Hoof1EGCWwHao4h/dFZLbnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:25:12.249114Z"},"content_sha256":"e9b85f245207f6f5c540734fd861e00e00909582fe1a669b8e69392c417ca79e","schema_version":"1.0","event_id":"sha256:e9b85f245207f6f5c540734fd861e00e00909582fe1a669b8e69392c417ca79e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GB4SFODHVF7TVM5OEERW5DD4MG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling partially ordered jobs faster than 2^n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2011-08-03T10:12:03Z","abstract_excerpt":"In the SCHED problem we are given a set of n jobs, together with their processing times and precedence constraints. The task is to order the jobs so that their total completion time is minimized. SCHED is a special case of the Traveling Repairman Problem with precedences. A natural dynamic programming algorithm solves both these problems in 2^n n^O(1) time, and whether there exists an algorithms solving SCHED in O(c^n) time for some constant c < 2 was an open problem posted in 2004 by Woeginger. In this paper we answer this question positively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0810","kind":"arxiv","version":2},"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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bxZlp6W5+blxXmYokQGt2yuoUlxFBw8vwNfZbPBAhRsEX1ftfaV57RYs2fSBEST+Ncm2IYrbIyQMplVV10R5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:25:12.249815Z"},"content_sha256":"f77f3a9d99d1a4dbc2fe10c74c91397eba7cb4fbb2d40b015b1e9b51ee70c20c","schema_version":"1.0","event_id":"sha256:f77f3a9d99d1a4dbc2fe10c74c91397eba7cb4fbb2d40b015b1e9b51ee70c20c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB4SFODHVF7TVM5OEERW5DD4MG/bundle.json","state_url":"https://pith.science/pith/GB4SFODHVF7TVM5OEERW5DD4MG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB4SFODHVF7TVM5OEERW5DD4MG/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-11T07:25:12Z","links":{"resolver":"https://pith.science/pith/GB4SFODHVF7TVM5OEERW5DD4MG","bundle":"https://pith.science/pith/GB4SFODHVF7TVM5OEERW5DD4MG/bundle.json","state":"https://pith.science/pith/GB4SFODHVF7TVM5OEERW5DD4MG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB4SFODHVF7TVM5OEERW5DD4MG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GB4SFODHVF7TVM5OEERW5DD4MG","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":"8f9ee0b2f70b9b524659401d7addfd76b2ea0edb7182e1c809a4cbb2a2ad9842","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-03T10:12:03Z","title_canon_sha256":"a98b64da38ed8876bd273cce4c5e4777d908a3414ac605fcbdc230b99282230a"},"schema_version":"1.0","source":{"id":"1108.0810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0810","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0810v2","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0810","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"GB4SFODHVF7T","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GB4SFODHVF7TVM5O","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GB4SFODH","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:f77f3a9d99d1a4dbc2fe10c74c91397eba7cb4fbb2d40b015b1e9b51ee70c20c","target":"graph","created_at":"2026-05-18T03:52:14Z","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":"In the SCHED problem we are given a set of n jobs, together with their processing times and precedence constraints. The task is to order the jobs so that their total completion time is minimized. SCHED is a special case of the Traveling Repairman Problem with precedences. A natural dynamic programming algorithm solves both these problems in 2^n n^O(1) time, and whether there exists an algorithms solving SCHED in O(c^n) time for some constant c < 2 was an open problem posted in 2004 by Woeginger. In this paper we answer this question positively.","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-03T10:12:03Z","title":"Scheduling partially ordered jobs faster than 2^n"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0810","kind":"arxiv","version":2},"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:e9b85f245207f6f5c540734fd861e00e00909582fe1a669b8e69392c417ca79e","target":"record","created_at":"2026-05-18T03:52:14Z","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":"8f9ee0b2f70b9b524659401d7addfd76b2ea0edb7182e1c809a4cbb2a2ad9842","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-03T10:12:03Z","title_canon_sha256":"a98b64da38ed8876bd273cce4c5e4777d908a3414ac605fcbdc230b99282230a"},"schema_version":"1.0","source":{"id":"1108.0810","kind":"arxiv","version":2}},"canonical_sha256":"307922b867a97f3ab3ae21236e8c7c619ea09f35120a792e044e04770302d136","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"307922b867a97f3ab3ae21236e8c7c619ea09f35120a792e044e04770302d136","first_computed_at":"2026-05-18T03:52:14.971275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:14.971275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BVXf4XJFyQeYYZ3MPnOZ4kVrzcFVqVhJ3Rwm9QQvB7YPf65mo5lPM5Pw6HFEV0bZU/KJBm/Y2Z7nZ1+suT6eCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:14.972049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9b85f245207f6f5c540734fd861e00e00909582fe1a669b8e69392c417ca79e","sha256:f77f3a9d99d1a4dbc2fe10c74c91397eba7cb4fbb2d40b015b1e9b51ee70c20c"],"state_sha256":"bd3f4eeee780a3a11bdc5679911a9489678e54386479a171a4fb3fb39514d9de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBgpo1u6g9e16/ky0iThJN4EUx32Tw9KNkBBBbr9tKkOkLUfZMnzYmpDjZPpjIXgwIda8ZU6CbZ2Sn8CPZ21Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:25:12.254510Z","bundle_sha256":"779448215cb9e3ef8b4a641b80d960124f435903558bc7ad63f7a4382d798526"}}