{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y4VSMTYGFYSVDW7USRMRV52LFC","short_pith_number":"pith:Y4VSMTYG","canonical_record":{"source":{"id":"1210.2906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-10T13:19:52Z","cross_cats_sorted":[],"title_canon_sha256":"046977f9a24e0e6b44e98966d5415f845da214ce47959db63098269457844516","abstract_canon_sha256":"a9d2bb334414394821ea3aa943eb8998a21e2a953298111aa0ae2929ce6ee45e"},"schema_version":"1.0"},"canonical_sha256":"c72b264f062e2551dbf494591af74b289c98b3b2b0cd85f9f4b3c70eebc3a88f","source":{"kind":"arxiv","id":"1210.2906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2906","created_at":"2026-05-18T03:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2906v1","created_at":"2026-05-18T03:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2906","created_at":"2026-05-18T03:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y4VSMTYGFYSV","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y4VSMTYGFYSVDW7U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y4VSMTYG","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y4VSMTYGFYSVDW7USRMRV52LFC","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-10T13:19:52Z","cross_cats_sorted":[],"title_canon_sha256":"046977f9a24e0e6b44e98966d5415f845da214ce47959db63098269457844516","abstract_canon_sha256":"a9d2bb334414394821ea3aa943eb8998a21e2a953298111aa0ae2929ce6ee45e"},"schema_version":"1.0"},"canonical_sha256":"c72b264f062e2551dbf494591af74b289c98b3b2b0cd85f9f4b3c70eebc3a88f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:31.176650Z","signature_b64":"7M9Eg8duyST8fGAhcba9coCi8tHsugq/AMQDnkqpdzYdmIRnEHLQB8hCp0Q46k0RPvV+2DQhQWvNV4DEx5i0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c72b264f062e2551dbf494591af74b289c98b3b2b0cd85f9f4b3c70eebc3a88f","last_reissued_at":"2026-05-18T03:43:31.176062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:31.176062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2906","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-18T03:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jf9i+BhOq7lZuAJ87N8QdsUkC+5hSTsqYP2ma6DJ8NxAXhe5vj5MWC2SdGJS865Z5BSlj/khfmEPMOLLtlzgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:02.220372Z"},"content_sha256":"6ebeb7b1ab39bd4b5a26d181eae96f81489be4737dc5c9734c1b2b6cbb500d6e","schema_version":"1.0","event_id":"sha256:6ebeb7b1ab39bd4b5a26d181eae96f81489be4737dc5c9734c1b2b6cbb500d6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y4VSMTYGFYSVDW7USRMRV52LFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Resources for Executing a Partial Set of Jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arindam Pal, Sambuddha Roy, Venkatesan Chakaravarthy, Yogish Sabharwal","submitted_at":"2012-10-10T13:19:52Z","abstract_excerpt":"In this paper, we consider the problem of choosing a minimum cost set of resources for executing a specified set of jobs. Each input job is an interval, determined by its start-time and end-time. Each resource is also an interval determined by its start-time and end-time; moreover, every resource has a capacity and a cost associated with it. We consider two versions of this problem. In the partial covering version, we are also given as input a number k, specifying the number of jobs that must be performed. The goal is to choose k jobs and find a minimum cost set of resources to perform the cho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2906","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-18T03:43:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiVoLP3nUMKdUf54R0qelUVrPsjOKoBeo7UzkF6KeCOU95TOFvRW66hKP4BbvvtLESKbpwVcQ8ffQ4MDOvaxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:34:02.220745Z"},"content_sha256":"b151a57e2b72c6572f21d7f3ec12277c6be0147cff7aff74cf1681eb26e07b1c","schema_version":"1.0","event_id":"sha256:b151a57e2b72c6572f21d7f3ec12277c6be0147cff7aff74cf1681eb26e07b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y4VSMTYGFYSVDW7USRMRV52LFC/bundle.json","state_url":"https://pith.science/pith/Y4VSMTYGFYSVDW7USRMRV52LFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y4VSMTYGFYSVDW7USRMRV52LFC/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-27T07:34:02Z","links":{"resolver":"https://pith.science/pith/Y4VSMTYGFYSVDW7USRMRV52LFC","bundle":"https://pith.science/pith/Y4VSMTYGFYSVDW7USRMRV52LFC/bundle.json","state":"https://pith.science/pith/Y4VSMTYGFYSVDW7USRMRV52LFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y4VSMTYGFYSVDW7USRMRV52LFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y4VSMTYGFYSVDW7USRMRV52LFC","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":"a9d2bb334414394821ea3aa943eb8998a21e2a953298111aa0ae2929ce6ee45e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-10T13:19:52Z","title_canon_sha256":"046977f9a24e0e6b44e98966d5415f845da214ce47959db63098269457844516"},"schema_version":"1.0","source":{"id":"1210.2906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2906","created_at":"2026-05-18T03:43:31Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2906v1","created_at":"2026-05-18T03:43:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2906","created_at":"2026-05-18T03:43:31Z"},{"alias_kind":"pith_short_12","alias_value":"Y4VSMTYGFYSV","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y4VSMTYGFYSVDW7U","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y4VSMTYG","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:b151a57e2b72c6572f21d7f3ec12277c6be0147cff7aff74cf1681eb26e07b1c","target":"graph","created_at":"2026-05-18T03:43:31Z","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 consider the problem of choosing a minimum cost set of resources for executing a specified set of jobs. Each input job is an interval, determined by its start-time and end-time. Each resource is also an interval determined by its start-time and end-time; moreover, every resource has a capacity and a cost associated with it. We consider two versions of this problem. In the partial covering version, we are also given as input a number k, specifying the number of jobs that must be performed. The goal is to choose k jobs and find a minimum cost set of resources to perform the cho","authors_text":"Arindam Pal, Sambuddha Roy, Venkatesan Chakaravarthy, Yogish Sabharwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-10T13:19:52Z","title":"Scheduling Resources for Executing a Partial Set of Jobs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2906","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:6ebeb7b1ab39bd4b5a26d181eae96f81489be4737dc5c9734c1b2b6cbb500d6e","target":"record","created_at":"2026-05-18T03:43:31Z","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":"a9d2bb334414394821ea3aa943eb8998a21e2a953298111aa0ae2929ce6ee45e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-10T13:19:52Z","title_canon_sha256":"046977f9a24e0e6b44e98966d5415f845da214ce47959db63098269457844516"},"schema_version":"1.0","source":{"id":"1210.2906","kind":"arxiv","version":1}},"canonical_sha256":"c72b264f062e2551dbf494591af74b289c98b3b2b0cd85f9f4b3c70eebc3a88f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c72b264f062e2551dbf494591af74b289c98b3b2b0cd85f9f4b3c70eebc3a88f","first_computed_at":"2026-05-18T03:43:31.176062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:31.176062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7M9Eg8duyST8fGAhcba9coCi8tHsugq/AMQDnkqpdzYdmIRnEHLQB8hCp0Q46k0RPvV+2DQhQWvNV4DEx5i0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:31.176650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ebeb7b1ab39bd4b5a26d181eae96f81489be4737dc5c9734c1b2b6cbb500d6e","sha256:b151a57e2b72c6572f21d7f3ec12277c6be0147cff7aff74cf1681eb26e07b1c"],"state_sha256":"dc9700af2fdc60b8690c90594800a2a29c8c99b12ae856551d01eb3db32273cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaRzdzFvzmYZJqylLP9FsvkchKo3O3+Rc/+geetOER2sXSjBzQFZbskeAfuPQ41jL/iWRPKv09JvjNK7E8wUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:34:02.223171Z","bundle_sha256":"3fc55c95b659639d9df48043bc0d3579e0d0f8fb9693d74823e4dab53296bdf5"}}