{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:B3SBDUSHJM5NYELTXR6IBCVBFV","short_pith_number":"pith:B3SBDUSH","canonical_record":{"source":{"id":"2509.01086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T03:18:20Z","cross_cats_sorted":[],"title_canon_sha256":"9317be902a533c7a5fbee24a8a2210500c052fd09469bce4d5e79633e298e3be","abstract_canon_sha256":"b2a92d58097ae7f2a90419e6b8b33bbf061058192d1c997c4475bbee7309445b"},"schema_version":"1.0"},"canonical_sha256":"0ee411d2474b3adc1173bc7c808aa12d519da791912fec36750c1cc26c8bbbb6","source":{"kind":"arxiv","id":"2509.01086","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01086","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01086v1","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01086","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"B3SBDUSHJM5N","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"B3SBDUSHJM5NYELT","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"B3SBDUSH","created_at":"2026-07-05T12:02:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:B3SBDUSHJM5NYELTXR6IBCVBFV","target":"record","payload":{"canonical_record":{"source":{"id":"2509.01086","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T03:18:20Z","cross_cats_sorted":[],"title_canon_sha256":"9317be902a533c7a5fbee24a8a2210500c052fd09469bce4d5e79633e298e3be","abstract_canon_sha256":"b2a92d58097ae7f2a90419e6b8b33bbf061058192d1c997c4475bbee7309445b"},"schema_version":"1.0"},"canonical_sha256":"0ee411d2474b3adc1173bc7c808aa12d519da791912fec36750c1cc26c8bbbb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:53.425395Z","signature_b64":"LqhygJ2+LZSUTzfYxuMiHOS2nVtBRWra6lo2ya03iY4cpo5QYeKXMm4SELTHWURFHAJ2k1jKdy5nVFuCuiVoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ee411d2474b3adc1173bc7c808aa12d519da791912fec36750c1cc26c8bbbb6","last_reissued_at":"2026-07-05T12:02:53.424924Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:53.424924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.01086","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-07-05T12:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVcOUL82tw2CuD01shl30zIhlwtHGnsOWtdyLsSo+AWUX2rfGUKrsda80qz2iVJBQbqPnBM7kFJfx6lyJ6edDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:23:35.047112Z"},"content_sha256":"900449b056b537d1231bfbc4a5ae9e05fbd7a4451b653f4b1c6552d8da3ae136","schema_version":"1.0","event_id":"sha256:900449b056b537d1231bfbc4a5ae9e05fbd7a4451b653f4b1c6552d8da3ae136"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:B3SBDUSHJM5NYELTXR6IBCVBFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hao Sun, Rathish Das","submitted_at":"2025-09-01T03:18:20Z","abstract_excerpt":"We study the precedence-constrained resource scheduling problem [SICOMP'75]. There are $n$ jobs where each job takes a certain time to finish and has a resource requirement throughout the execution time. There are precedence among the jobs. The problem asks that given a resource budget, schedule the jobs obeying the precedence constraints to minimize makespan (maximum completion time of a job) such that at any point in time, the total resource being used by all the jobs is at most the given resource budget. In the offline setting, an important open question is whether a polynomial-time $O(1)$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01086","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.01086/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T12:02:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9X22+LVbsQpP0R5/WE6iFElBxMj2Oy9S0UzEanS9oYmGT2mknWhMD8ejL1PS79M8yi2nIJpl7B/RZdAU6c5RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:23:35.047603Z"},"content_sha256":"b45b93bc3bd890d22df888bad926ccbcb2a74863d817b4d69f3337f57fbdab8b","schema_version":"1.0","event_id":"sha256:b45b93bc3bd890d22df888bad926ccbcb2a74863d817b4d69f3337f57fbdab8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B3SBDUSHJM5NYELTXR6IBCVBFV/bundle.json","state_url":"https://pith.science/pith/B3SBDUSHJM5NYELTXR6IBCVBFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B3SBDUSHJM5NYELTXR6IBCVBFV/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-08-09T00:23:35Z","links":{"resolver":"https://pith.science/pith/B3SBDUSHJM5NYELTXR6IBCVBFV","bundle":"https://pith.science/pith/B3SBDUSHJM5NYELTXR6IBCVBFV/bundle.json","state":"https://pith.science/pith/B3SBDUSHJM5NYELTXR6IBCVBFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B3SBDUSHJM5NYELTXR6IBCVBFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:B3SBDUSHJM5NYELTXR6IBCVBFV","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":"b2a92d58097ae7f2a90419e6b8b33bbf061058192d1c997c4475bbee7309445b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T03:18:20Z","title_canon_sha256":"9317be902a533c7a5fbee24a8a2210500c052fd09469bce4d5e79633e298e3be"},"schema_version":"1.0","source":{"id":"2509.01086","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.01086","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"arxiv_version","alias_value":"2509.01086v1","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.01086","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"pith_short_12","alias_value":"B3SBDUSHJM5N","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"pith_short_16","alias_value":"B3SBDUSHJM5NYELT","created_at":"2026-07-05T12:02:53Z"},{"alias_kind":"pith_short_8","alias_value":"B3SBDUSH","created_at":"2026-07-05T12:02:53Z"}],"graph_snapshots":[{"event_id":"sha256:b45b93bc3bd890d22df888bad926ccbcb2a74863d817b4d69f3337f57fbdab8b","target":"graph","created_at":"2026-07-05T12:02:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.01086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the precedence-constrained resource scheduling problem [SICOMP'75]. There are $n$ jobs where each job takes a certain time to finish and has a resource requirement throughout the execution time. There are precedence among the jobs. The problem asks that given a resource budget, schedule the jobs obeying the precedence constraints to minimize makespan (maximum completion time of a job) such that at any point in time, the total resource being used by all the jobs is at most the given resource budget. In the offline setting, an important open question is whether a polynomial-time $O(1)$-","authors_text":"Hao Sun, Rathish Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T03:18:20Z","title":"Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.01086","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:900449b056b537d1231bfbc4a5ae9e05fbd7a4451b653f4b1c6552d8da3ae136","target":"record","created_at":"2026-07-05T12:02:53Z","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":"b2a92d58097ae7f2a90419e6b8b33bbf061058192d1c997c4475bbee7309445b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-09-01T03:18:20Z","title_canon_sha256":"9317be902a533c7a5fbee24a8a2210500c052fd09469bce4d5e79633e298e3be"},"schema_version":"1.0","source":{"id":"2509.01086","kind":"arxiv","version":1}},"canonical_sha256":"0ee411d2474b3adc1173bc7c808aa12d519da791912fec36750c1cc26c8bbbb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ee411d2474b3adc1173bc7c808aa12d519da791912fec36750c1cc26c8bbbb6","first_computed_at":"2026-07-05T12:02:53.424924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:53.424924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LqhygJ2+LZSUTzfYxuMiHOS2nVtBRWra6lo2ya03iY4cpo5QYeKXMm4SELTHWURFHAJ2k1jKdy5nVFuCuiVoDA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:53.425395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.01086","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:900449b056b537d1231bfbc4a5ae9e05fbd7a4451b653f4b1c6552d8da3ae136","sha256:b45b93bc3bd890d22df888bad926ccbcb2a74863d817b4d69f3337f57fbdab8b"],"state_sha256":"7a074737a516cf932be4c0c653c647ca431268a7aa43ea9c5ef544ba4aeb32f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MBk/QKKwDuo1FAT0IgtUEmI3ViENPy4kO/EDhI9OKy8RdgX/1U4nCrr74o5BX0QWiwaolmbCh5Uh3HpdHD/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:23:35.051083Z","bundle_sha256":"6ed8c6f9a66ee65c6b36f96acdeac965dc4ed33c420030b8007db570d9621fac"}}