{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LZ7S2EHNXAGCCP3O3VCEC2AZCP","short_pith_number":"pith:LZ7S2EHN","canonical_record":{"source":{"id":"1905.13740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T17:49:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e938a4708bfe2b277b0300122744c40f107bc29e6e5e3deb55caff1d482a6632","abstract_canon_sha256":"dc3d88945ba4f3283f8b6efbe8fa6fd9f45e0a7ee138e3ce50444bde68ba6cca"},"schema_version":"1.0"},"canonical_sha256":"5e7f2d10edb80c213f6edd4441681913cd3be2052ccd17d86e52e0d20f74d9f3","source":{"kind":"arxiv","id":"1905.13740","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13740","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13740v2","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13740","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"LZ7S2EHNXAGC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LZ7S2EHNXAGCCP3O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LZ7S2EHN","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LZ7S2EHNXAGCCP3O3VCEC2AZCP","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13740","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T17:49:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e938a4708bfe2b277b0300122744c40f107bc29e6e5e3deb55caff1d482a6632","abstract_canon_sha256":"dc3d88945ba4f3283f8b6efbe8fa6fd9f45e0a7ee138e3ce50444bde68ba6cca"},"schema_version":"1.0"},"canonical_sha256":"5e7f2d10edb80c213f6edd4441681913cd3be2052ccd17d86e52e0d20f74d9f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:13.389096Z","signature_b64":"TCRMqLKlv7BHVouvDAPTi9fhLPjlE/Gx9wt0sm92pq8AgJqJnrcWzHieByhRQ34d6KlItQUSN5K2pff1oKRJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e7f2d10edb80c213f6edd4441681913cd3be2052ccd17d86e52e0d20f74d9f3","last_reissued_at":"2026-05-17T23:42:13.388604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:13.388604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13740","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-17T23:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"09qoVMzk2B4HA/iJqNCYJCsa6WuSyPI8AP4spsSHixP7JEnk6SPLXTzf7+Wv5d7NSt3+b9deroHiSnKzmcUMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:29:37.919580Z"},"content_sha256":"3c9be17ab4ad74c688962efcd1fdf82c7d3564695b33cb1c8a7ad877f671de78","schema_version":"1.0","event_id":"sha256:3c9be17ab4ad74c688962efcd1fdf82c7d3564695b33cb1c8a7ad877f671de78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LZ7S2EHNXAGCCP3O3VCEC2AZCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budget Minimization with Precedence Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Clara Waldmann, Felix Happach, Marcus Kaiser, Marinus Gottschau","submitted_at":"2019-05-31T17:49:00Z","abstract_excerpt":"Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs $(N, \\unlhd)$. A job $j \\in N$ is available for scheduling, if all jobs $i \\in N$ with $i \\unlhd j$ are completed. Further, each job $j \\in N$ is assigned real valued costs $c_{j}$, which can be negative or positive. A schedule is an ordering $j_{1}, \\dots, j_{\\vert N \\vert}$ of all jobs in $N$. The budget of a schedule is the external investment needed to complete all jobs, i.e., it is $\\max_{l \\in \\{0, \\dots, \\vert N \\vert \\} } \\sum_{1 \\le k \\le l} c_{j_{k}}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13740","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-17T23:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qC/q4WxVLDAwQk1ZVd1xUo9DooC8pFIx6q/v74952tyugMI84wqg+KK2ubaFsipWoJ7sAEGCpFIcxERVvqqZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:29:37.920201Z"},"content_sha256":"dac5dd17460f116e30384d64f475ae8d18624521c92dbf8efab4780b8be16ca7","schema_version":"1.0","event_id":"sha256:dac5dd17460f116e30384d64f475ae8d18624521c92dbf8efab4780b8be16ca7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/bundle.json","state_url":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/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-31T07:29:37Z","links":{"resolver":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP","bundle":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/bundle.json","state":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LZ7S2EHNXAGCCP3O3VCEC2AZCP","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":"dc3d88945ba4f3283f8b6efbe8fa6fd9f45e0a7ee138e3ce50444bde68ba6cca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T17:49:00Z","title_canon_sha256":"e938a4708bfe2b277b0300122744c40f107bc29e6e5e3deb55caff1d482a6632"},"schema_version":"1.0","source":{"id":"1905.13740","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13740","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13740v2","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13740","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"LZ7S2EHNXAGC","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LZ7S2EHNXAGCCP3O","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LZ7S2EHN","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:dac5dd17460f116e30384d64f475ae8d18624521c92dbf8efab4780b8be16ca7","target":"graph","created_at":"2026-05-17T23:42:13Z","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":"Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs $(N, \\unlhd)$. A job $j \\in N$ is available for scheduling, if all jobs $i \\in N$ with $i \\unlhd j$ are completed. Further, each job $j \\in N$ is assigned real valued costs $c_{j}$, which can be negative or positive. A schedule is an ordering $j_{1}, \\dots, j_{\\vert N \\vert}$ of all jobs in $N$. The budget of a schedule is the external investment needed to complete all jobs, i.e., it is $\\max_{l \\in \\{0, \\dots, \\vert N \\vert \\} } \\sum_{1 \\le k \\le l} c_{j_{k}}$","authors_text":"Clara Waldmann, Felix Happach, Marcus Kaiser, Marinus Gottschau","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T17:49:00Z","title":"Budget Minimization with Precedence Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13740","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:3c9be17ab4ad74c688962efcd1fdf82c7d3564695b33cb1c8a7ad877f671de78","target":"record","created_at":"2026-05-17T23:42:13Z","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":"dc3d88945ba4f3283f8b6efbe8fa6fd9f45e0a7ee138e3ce50444bde68ba6cca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-31T17:49:00Z","title_canon_sha256":"e938a4708bfe2b277b0300122744c40f107bc29e6e5e3deb55caff1d482a6632"},"schema_version":"1.0","source":{"id":"1905.13740","kind":"arxiv","version":2}},"canonical_sha256":"5e7f2d10edb80c213f6edd4441681913cd3be2052ccd17d86e52e0d20f74d9f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e7f2d10edb80c213f6edd4441681913cd3be2052ccd17d86e52e0d20f74d9f3","first_computed_at":"2026-05-17T23:42:13.388604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:13.388604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TCRMqLKlv7BHVouvDAPTi9fhLPjlE/Gx9wt0sm92pq8AgJqJnrcWzHieByhRQ34d6KlItQUSN5K2pff1oKRJBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:13.389096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13740","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c9be17ab4ad74c688962efcd1fdf82c7d3564695b33cb1c8a7ad877f671de78","sha256:dac5dd17460f116e30384d64f475ae8d18624521c92dbf8efab4780b8be16ca7"],"state_sha256":"9568203abe295995417644fe78c611ca3e57f8d3061e1497d3ef6bf42f3b60c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5AGzHq3wQ/6cnv19QQDQd4eiV0ijfL14PbOPLIkiOFdqSL9gdniazzh33OgzH8D44WYQHkE8phC8uys3cHFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:29:37.923550Z","bundle_sha256":"4888693e6a239dc6df249c9b3c4082e3eb4a92a97f86e5e14067e775ff180646"}}