{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RSEVKSTF7ONFRTYJOHLOLED7XB","short_pith_number":"pith:RSEVKSTF","canonical_record":{"source":{"id":"1401.7284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-28T18:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"af914ffda9a279cbfa7f81f2e4174f131b9e6491c3d7634622079eb09f9c4e16","abstract_canon_sha256":"fa0e888e8e1e3136a839163e948ab08dc6dce764193f65d964ddebd16065103a"},"schema_version":"1.0"},"canonical_sha256":"8c89554a65fb9a58cf0971d6e5907fb85be88fb7b14c72cb865b27fdd266f630","source":{"kind":"arxiv","id":"1401.7284","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7284","created_at":"2026-05-18T01:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7284v2","created_at":"2026-05-18T01:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7284","created_at":"2026-05-18T01:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"RSEVKSTF7ONF","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RSEVKSTF7ONFRTYJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RSEVKSTF","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RSEVKSTF7ONFRTYJOHLOLED7XB","target":"record","payload":{"canonical_record":{"source":{"id":"1401.7284","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-28T18:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"af914ffda9a279cbfa7f81f2e4174f131b9e6491c3d7634622079eb09f9c4e16","abstract_canon_sha256":"fa0e888e8e1e3136a839163e948ab08dc6dce764193f65d964ddebd16065103a"},"schema_version":"1.0"},"canonical_sha256":"8c89554a65fb9a58cf0971d6e5907fb85be88fb7b14c72cb865b27fdd266f630","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:34.082362Z","signature_b64":"OIEffLT4KrA2sogjOzwFDV46RNJ1exdbEi/EgIk+QEUiTWLY8lftBiyhmueZOYm3O1exPJF6jzT2xlJpheO/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c89554a65fb9a58cf0971d6e5907fb85be88fb7b14c72cb865b27fdd266f630","last_reissued_at":"2026-05-18T01:55:34.081557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:34.081557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.7284","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-18T01:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tks4ljsbmKnYcESiauV3moi1IpLU4RwOPRNWcoIGY5mkBb/DasMjtHYtTobqN8RlXX/8fNYlil0C8jL7qYBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:57.693212Z"},"content_sha256":"a6f2ac18fe535426ee7f7dc4491c8aef494176006beb59d003dec79989d79ee2","schema_version":"1.0","event_id":"sha256:a6f2ac18fe535426ee7f7dc4491c8aef494176006beb59d003dec79989d79ee2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RSEVKSTF7ONFRTYJOHLOLED7XB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Flow-Time on Unrelated Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Janardhan Kulkarni, Nikhil Bansal","submitted_at":"2014-01-28T18:09:20Z","abstract_excerpt":"We consider some flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of $m$ machines and a set of $n$ jobs, and each job $j$ has a machine dependent processing time of $p_{ij}$ on machine $i$. The flow-time of a job is the total time the job spends in the system (completion time minus its arrival time), and is one of the most natural quality of service measure. We show the following two results: an $O(\\min(\\log^2 n,\\log n \\log P))$ approximation algorithm for minimizing the total-flow time, and an $O(\\log n)$ approximation for minimizing the maxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7284","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-18T01:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NSJQGxbq8m6xMz02/Hv2ucayHZvkRCfrzYHpVIe6Dk05TcqMkqRcF1GivlTeCm+B078aKpSV5FtL3X8JfprvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:57.693604Z"},"content_sha256":"753cbef7e92be4fd5cf931d313cd37bbd33c2011c525f592cb1a113db735ccbd","schema_version":"1.0","event_id":"sha256:753cbef7e92be4fd5cf931d313cd37bbd33c2011c525f592cb1a113db735ccbd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RSEVKSTF7ONFRTYJOHLOLED7XB/bundle.json","state_url":"https://pith.science/pith/RSEVKSTF7ONFRTYJOHLOLED7XB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RSEVKSTF7ONFRTYJOHLOLED7XB/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-31T00:26:57Z","links":{"resolver":"https://pith.science/pith/RSEVKSTF7ONFRTYJOHLOLED7XB","bundle":"https://pith.science/pith/RSEVKSTF7ONFRTYJOHLOLED7XB/bundle.json","state":"https://pith.science/pith/RSEVKSTF7ONFRTYJOHLOLED7XB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RSEVKSTF7ONFRTYJOHLOLED7XB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RSEVKSTF7ONFRTYJOHLOLED7XB","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":"fa0e888e8e1e3136a839163e948ab08dc6dce764193f65d964ddebd16065103a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-28T18:09:20Z","title_canon_sha256":"af914ffda9a279cbfa7f81f2e4174f131b9e6491c3d7634622079eb09f9c4e16"},"schema_version":"1.0","source":{"id":"1401.7284","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.7284","created_at":"2026-05-18T01:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.7284v2","created_at":"2026-05-18T01:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7284","created_at":"2026-05-18T01:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"RSEVKSTF7ONF","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RSEVKSTF7ONFRTYJ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RSEVKSTF","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:753cbef7e92be4fd5cf931d313cd37bbd33c2011c525f592cb1a113db735ccbd","target":"graph","created_at":"2026-05-18T01:55:34Z","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":"We consider some flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of $m$ machines and a set of $n$ jobs, and each job $j$ has a machine dependent processing time of $p_{ij}$ on machine $i$. The flow-time of a job is the total time the job spends in the system (completion time minus its arrival time), and is one of the most natural quality of service measure. We show the following two results: an $O(\\min(\\log^2 n,\\log n \\log P))$ approximation algorithm for minimizing the total-flow time, and an $O(\\log n)$ approximation for minimizing the maxim","authors_text":"Janardhan Kulkarni, Nikhil Bansal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-28T18:09:20Z","title":"Minimizing Flow-Time on Unrelated Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7284","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:a6f2ac18fe535426ee7f7dc4491c8aef494176006beb59d003dec79989d79ee2","target":"record","created_at":"2026-05-18T01:55:34Z","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":"fa0e888e8e1e3136a839163e948ab08dc6dce764193f65d964ddebd16065103a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-28T18:09:20Z","title_canon_sha256":"af914ffda9a279cbfa7f81f2e4174f131b9e6491c3d7634622079eb09f9c4e16"},"schema_version":"1.0","source":{"id":"1401.7284","kind":"arxiv","version":2}},"canonical_sha256":"8c89554a65fb9a58cf0971d6e5907fb85be88fb7b14c72cb865b27fdd266f630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c89554a65fb9a58cf0971d6e5907fb85be88fb7b14c72cb865b27fdd266f630","first_computed_at":"2026-05-18T01:55:34.081557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:34.081557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OIEffLT4KrA2sogjOzwFDV46RNJ1exdbEi/EgIk+QEUiTWLY8lftBiyhmueZOYm3O1exPJF6jzT2xlJpheO/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:34.082362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.7284","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6f2ac18fe535426ee7f7dc4491c8aef494176006beb59d003dec79989d79ee2","sha256:753cbef7e92be4fd5cf931d313cd37bbd33c2011c525f592cb1a113db735ccbd"],"state_sha256":"024c50ebedf4273dea721431374eb34a5317d1f9f586fb458c699e755af5bf7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5pEenbIozv6IW4TuAfZdP96HEfCmevUUi+RRG0WeOTTVF8vFkKy9TVz3fZonU6Hu4Dy1vuDlcldplDXXcwaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:26:57.696586Z","bundle_sha256":"31877bb70fdd150822ccd2d08cae0d9e7b3efcdb6bd4009d31a82323bd7907e6"}}