{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S6IMMZRDJ2EG2246HRO3OSD3CZ","short_pith_number":"pith:S6IMMZRD","canonical_record":{"source":{"id":"1704.06677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T18:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"14b02d598efdbac62316acf17bf8e1594c290e5d6e65f3367b762e9eab7f5cc0","abstract_canon_sha256":"4ce3311e103746896a446a8a35a066e49de38c7ec2073958afbdbbe31fad26e6"},"schema_version":"1.0"},"canonical_sha256":"9790c666234e886d6b9e3c5db7487b167797b22030759485131148a725b677bb","source":{"kind":"arxiv","id":"1704.06677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06677","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06677v1","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06677","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"S6IMMZRDJ2EG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S6IMMZRDJ2EG2246","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S6IMMZRD","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S6IMMZRDJ2EG2246HRO3OSD3CZ","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T18:42:43Z","cross_cats_sorted":[],"title_canon_sha256":"14b02d598efdbac62316acf17bf8e1594c290e5d6e65f3367b762e9eab7f5cc0","abstract_canon_sha256":"4ce3311e103746896a446a8a35a066e49de38c7ec2073958afbdbbe31fad26e6"},"schema_version":"1.0"},"canonical_sha256":"9790c666234e886d6b9e3c5db7487b167797b22030759485131148a725b677bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:57.928111Z","signature_b64":"iwKySCZR5RGZETqy9WYnVMBAeUgNaBVvroVNgOkcdyJQ8PnUljd2dKp8nuS1EA3KJmP8VTcORKwIXfVr4Zg+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9790c666234e886d6b9e3c5db7487b167797b22030759485131148a725b677bb","last_reissued_at":"2026-05-18T00:45:57.927670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:57.927670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06677","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:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64wr51Mf2lQlCi1wVqaWqjTe7ac+o58aV8/ec5aLQVJby/ea1qPLj07UMAAU9aObuqVbjZcKqZZ4V68kc0m/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:49:48.969370Z"},"content_sha256":"c83dfa0dde6826ba974bc5a5b00a966ffb6d23f54b6d388d8b3d5bf25c640193","schema_version":"1.0","event_id":"sha256:c83dfa0dde6826ba974bc5a5b00a966ffb6d23f54b6d388d8b3d5bf25c640193"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S6IMMZRDJ2EG2246HRO3OSD3CZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jingling Li, Kevin Sun, Pascal Sturmfels, Prayaag Venkat, Samir Khuller","submitted_at":"2017-04-21T18:42:43Z","abstract_excerpt":"In this paper, we introduce a new online scheduling framework for minimizing total weighted completion time in a general setting. The framework is inspired by the work of Hall et al. [Mathematics of Operations Research, Vol 22(3):513-544, 1997] and Garg et al. [Proc. of Foundations of Software Technology and Theoretical Computer Science, pp. 96-107, 2007], who show how to convert an offline approximation to an online scheme. Our framework uses two offline approximation algorithms (one for the simpler problem of scheduling without release times, and another for the minimum unscheduled weight pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06677","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:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BWv8lk3rhX3LXm8c6wYaF2g462fZBCnyMeozeizkZvRCeSl743vEdqhbjMrb6ZvuozZ4m6QdYbTPgHogESymBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:49:48.970072Z"},"content_sha256":"d85ae60bb1e3b8bec93146f3af94b3c652370e74c89b000f7ddfb80192851efe","schema_version":"1.0","event_id":"sha256:d85ae60bb1e3b8bec93146f3af94b3c652370e74c89b000f7ddfb80192851efe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ/bundle.json","state_url":"https://pith.science/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ/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-05-27T05:49:48Z","links":{"resolver":"https://pith.science/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ","bundle":"https://pith.science/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ/bundle.json","state":"https://pith.science/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6IMMZRDJ2EG2246HRO3OSD3CZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S6IMMZRDJ2EG2246HRO3OSD3CZ","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":"4ce3311e103746896a446a8a35a066e49de38c7ec2073958afbdbbe31fad26e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T18:42:43Z","title_canon_sha256":"14b02d598efdbac62316acf17bf8e1594c290e5d6e65f3367b762e9eab7f5cc0"},"schema_version":"1.0","source":{"id":"1704.06677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06677","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06677v1","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06677","created_at":"2026-05-18T00:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"S6IMMZRDJ2EG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S6IMMZRDJ2EG2246","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S6IMMZRD","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:d85ae60bb1e3b8bec93146f3af94b3c652370e74c89b000f7ddfb80192851efe","target":"graph","created_at":"2026-05-18T00:45:57Z","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 this paper, we introduce a new online scheduling framework for minimizing total weighted completion time in a general setting. The framework is inspired by the work of Hall et al. [Mathematics of Operations Research, Vol 22(3):513-544, 1997] and Garg et al. [Proc. of Foundations of Software Technology and Theoretical Computer Science, pp. 96-107, 2007], who show how to convert an offline approximation to an online scheme. Our framework uses two offline approximation algorithms (one for the simpler problem of scheduling without release times, and another for the minimum unscheduled weight pr","authors_text":"Jingling Li, Kevin Sun, Pascal Sturmfels, Prayaag Venkat, Samir Khuller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T18:42:43Z","title":"Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06677","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:c83dfa0dde6826ba974bc5a5b00a966ffb6d23f54b6d388d8b3d5bf25c640193","target":"record","created_at":"2026-05-18T00:45:57Z","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":"4ce3311e103746896a446a8a35a066e49de38c7ec2073958afbdbbe31fad26e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-21T18:42:43Z","title_canon_sha256":"14b02d598efdbac62316acf17bf8e1594c290e5d6e65f3367b762e9eab7f5cc0"},"schema_version":"1.0","source":{"id":"1704.06677","kind":"arxiv","version":1}},"canonical_sha256":"9790c666234e886d6b9e3c5db7487b167797b22030759485131148a725b677bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9790c666234e886d6b9e3c5db7487b167797b22030759485131148a725b677bb","first_computed_at":"2026-05-18T00:45:57.927670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:57.927670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iwKySCZR5RGZETqy9WYnVMBAeUgNaBVvroVNgOkcdyJQ8PnUljd2dKp8nuS1EA3KJmP8VTcORKwIXfVr4Zg+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:57.928111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c83dfa0dde6826ba974bc5a5b00a966ffb6d23f54b6d388d8b3d5bf25c640193","sha256:d85ae60bb1e3b8bec93146f3af94b3c652370e74c89b000f7ddfb80192851efe"],"state_sha256":"4b93c8257bbff064d8f8783ea4a5f741106147858a2e3bc90f1b23847e0c1674"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uWTNavSZOlPgFlifV5TEbF2VRBpnI7sn03q3Xjqak5/fxycZ4YndrljNm0MB51GCLxDEdR4TkRM0VlWjtrWLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:49:48.973704Z","bundle_sha256":"0f5a0a8c7f2d216cb055e6cea9153753674275509ac7f5f73a88f49b34bd4edc"}}