{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GLIBTEKLIJYZPIKKOWTAXNDK6J","short_pith_number":"pith:GLIBTEKL","canonical_record":{"source":{"id":"1404.1097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T20:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"d6348c6a75a4adc006bd6ea9438492d6e8ff6b268e8ceb92d1bf4862aa9c0101","abstract_canon_sha256":"5e510b438a87fe650f7a61d944654acfadcf80e1750a694ea3761d6560dc3121"},"schema_version":"1.0"},"canonical_sha256":"32d019914b427197a14a75a60bb46af273c59e20f5cd91bb202e5c6a3db50c85","source":{"kind":"arxiv","id":"1404.1097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1097","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1097v1","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1097","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"GLIBTEKLIJYZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GLIBTEKLIJYZPIKK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GLIBTEKL","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GLIBTEKLIJYZPIKKOWTAXNDK6J","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T20:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"d6348c6a75a4adc006bd6ea9438492d6e8ff6b268e8ceb92d1bf4862aa9c0101","abstract_canon_sha256":"5e510b438a87fe650f7a61d944654acfadcf80e1750a694ea3761d6560dc3121"},"schema_version":"1.0"},"canonical_sha256":"32d019914b427197a14a75a60bb46af273c59e20f5cd91bb202e5c6a3db50c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:54.215152Z","signature_b64":"rDbRhKZNDQ4nsZeVxQD9dDyXxjs0T/kixU8oh/VFR/I2FqdMo+Kx0V6zGDBMPIQdf9SxarjyzCxLTj43gnYcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d019914b427197a14a75a60bb46af273c59e20f5cd91bb202e5c6a3db50c85","last_reissued_at":"2026-05-18T02:54:54.214581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:54.214581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1097","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-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hvd57rrFgJI2atx8m0HyAvP+fuAgvOhJR35XLK1k2yEYPZzYjGaDk5pYjLrjdkkr89Z4GwbgsOFX/Jf3hEoXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:03:51.565901Z"},"content_sha256":"6f554c06157973720afa1e356011e55c24d651f389319011a05546ba29a54dfb","schema_version":"1.0","event_id":"sha256:6f554c06157973720afa1e356011e55c24d651f389319011a05546ba29a54dfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GLIBTEKLIJYZPIKKOWTAXNDK6J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Janardhan Kulkarni, Kamesh Munagala, Sungjin Im","submitted_at":"2014-04-03T20:54:24Z","abstract_excerpt":"We introduce and study a general scheduling problem that we term the Packing Scheduling problem. In this problem, jobs can have different arrival times and sizes; a scheduler can process job $j$ at rate $x_j$, subject to arbitrary packing constraints over the set of rates ($\\vec{x}$) of the outstanding jobs. The PSP framework captures a variety of scheduling problems, including the classical problems of unrelated machines scheduling, broadcast scheduling, and scheduling jobs of different parallelizability. It also captures scheduling constraints arising in diverse modern environments ranging f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1097","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-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BR7/g+PcOqGvcjyEVKRt2IHAeHBTKi66qRwgaJJ6oMGALxuay5Ko8L/0oiv+rz2W+Tw+BvmRFgJbF5fhJO/gCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:03:51.566247Z"},"content_sha256":"df290548a702c729bfa549c38ec05d1e2e31653a39d437cc764acd84e20c2fbb","schema_version":"1.0","event_id":"sha256:df290548a702c729bfa549c38ec05d1e2e31653a39d437cc764acd84e20c2fbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J/bundle.json","state_url":"https://pith.science/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J/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-27T19:03:51Z","links":{"resolver":"https://pith.science/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J","bundle":"https://pith.science/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J/bundle.json","state":"https://pith.science/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLIBTEKLIJYZPIKKOWTAXNDK6J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GLIBTEKLIJYZPIKKOWTAXNDK6J","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":"5e510b438a87fe650f7a61d944654acfadcf80e1750a694ea3761d6560dc3121","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T20:54:24Z","title_canon_sha256":"d6348c6a75a4adc006bd6ea9438492d6e8ff6b268e8ceb92d1bf4862aa9c0101"},"schema_version":"1.0","source":{"id":"1404.1097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1097","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1097v1","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1097","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"GLIBTEKLIJYZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GLIBTEKLIJYZPIKK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GLIBTEKL","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:df290548a702c729bfa549c38ec05d1e2e31653a39d437cc764acd84e20c2fbb","target":"graph","created_at":"2026-05-18T02:54:54Z","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 introduce and study a general scheduling problem that we term the Packing Scheduling problem. In this problem, jobs can have different arrival times and sizes; a scheduler can process job $j$ at rate $x_j$, subject to arbitrary packing constraints over the set of rates ($\\vec{x}$) of the outstanding jobs. The PSP framework captures a variety of scheduling problems, including the classical problems of unrelated machines scheduling, broadcast scheduling, and scheduling jobs of different parallelizability. It also captures scheduling constraints arising in diverse modern environments ranging f","authors_text":"Janardhan Kulkarni, Kamesh Munagala, Sungjin Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T20:54:24Z","title":"Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1097","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:6f554c06157973720afa1e356011e55c24d651f389319011a05546ba29a54dfb","target":"record","created_at":"2026-05-18T02:54:54Z","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":"5e510b438a87fe650f7a61d944654acfadcf80e1750a694ea3761d6560dc3121","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T20:54:24Z","title_canon_sha256":"d6348c6a75a4adc006bd6ea9438492d6e8ff6b268e8ceb92d1bf4862aa9c0101"},"schema_version":"1.0","source":{"id":"1404.1097","kind":"arxiv","version":1}},"canonical_sha256":"32d019914b427197a14a75a60bb46af273c59e20f5cd91bb202e5c6a3db50c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32d019914b427197a14a75a60bb46af273c59e20f5cd91bb202e5c6a3db50c85","first_computed_at":"2026-05-18T02:54:54.214581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:54.214581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rDbRhKZNDQ4nsZeVxQD9dDyXxjs0T/kixU8oh/VFR/I2FqdMo+Kx0V6zGDBMPIQdf9SxarjyzCxLTj43gnYcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:54.215152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f554c06157973720afa1e356011e55c24d651f389319011a05546ba29a54dfb","sha256:df290548a702c729bfa549c38ec05d1e2e31653a39d437cc764acd84e20c2fbb"],"state_sha256":"83dc70c6e9a125fea5e5226afaf63e8858fbbe8c418584103d67c3a13c56b488"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3lHlvALIMFz1+bHy2V5maS+bJS12fXGDf9IBOXw/U3i16G6rxzZaa+1J/L6KiuP5LixzWhl667Tis8wkvw96Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:03:51.568113Z","bundle_sha256":"4fbe1f1e062dcfd92618b2841370b8558498c38a82f80610f7f6b911ed5de5d4"}}