{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LZ7S2EHNXAGCCP3O3VCEC2AZCP","short_pith_number":"pith:LZ7S2EHN","schema_version":"1.0","canonical_sha256":"5e7f2d10edb80c213f6edd4441681913cd3be2052ccd17d86e52e0d20f74d9f3","source":{"kind":"arxiv","id":"1905.13740","version":2},"attestation_state":"computed","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}}$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.13740","created_at":"2026-05-17T23:42:13.388664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13740v2","created_at":"2026-05-17T23:42:13.388664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13740","created_at":"2026-05-17T23:42:13.388664+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZ7S2EHNXAGC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZ7S2EHNXAGCCP3O","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZ7S2EHN","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP","json":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP.json","graph_json":"https://pith.science/api/pith-number/LZ7S2EHNXAGCCP3O3VCEC2AZCP/graph.json","events_json":"https://pith.science/api/pith-number/LZ7S2EHNXAGCCP3O3VCEC2AZCP/events.json","paper":"https://pith.science/paper/LZ7S2EHN"},"agent_actions":{"view_html":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP","download_json":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP.json","view_paper":"https://pith.science/paper/LZ7S2EHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13740&json=true","fetch_graph":"https://pith.science/api/pith-number/LZ7S2EHNXAGCCP3O3VCEC2AZCP/graph.json","fetch_events":"https://pith.science/api/pith-number/LZ7S2EHNXAGCCP3O3VCEC2AZCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/action/storage_attestation","attest_author":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/action/author_attestation","sign_citation":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/action/citation_signature","submit_replication":"https://pith.science/pith/LZ7S2EHNXAGCCP3O3VCEC2AZCP/action/replication_record"}},"created_at":"2026-05-17T23:42:13.388664+00:00","updated_at":"2026-05-17T23:42:13.388664+00:00"}