{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YF25PVY5X5IHVY6HGMKVA6WYZA","short_pith_number":"pith:YF25PVY5","schema_version":"1.0","canonical_sha256":"c175d7d71dbf507ae3c73315507ad8c834944f0613cd74950cd578984d5e23f7","source":{"kind":"arxiv","id":"1507.04885","version":3},"attestation_state":"computed","paper":{"title":"Ordering with precedence constraints and budget minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Akbar Rafiey, Arash Rafiey, J\\'an Manuch, Jeff Kinne","submitted_at":"2015-07-17T09:11:56Z","abstract_excerpt":"We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph $H=(B,S)$. Vertices in $B$ are thought of as goods or services that must be \\emph{bought} to produce items in $S$ that are to be \\emph{sold}. An edge from $j\\in S$ to $i\\in B$ indicates that the production of $j$ requires the purchase of $i$. Each vertex in $B$ has a cost, and each vertex in $S$ results in some gain. The goal is to obtain an ordering of $B\\cup S$ that respects the precedence constraints and maximizes"},"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":"1507.04885","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-17T09:11:56Z","cross_cats_sorted":[],"title_canon_sha256":"ef5240b3a486c0ec6b64ce37e332e706516ba17e7689d904fec27757bc74c63e","abstract_canon_sha256":"bde86fb0797ab7f1583b2c74efe125ac6b260d7aa6a44319b3d5c6a1d29fb390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:31.093347Z","signature_b64":"RnoA6xm8kE8KdHbWqb8FN+89VL0pk0P/3cl0YUiX7y4ZQtO1gSBZQxL0NPakLeNOt6KcgYj6EkweblzQa604DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c175d7d71dbf507ae3c73315507ad8c834944f0613cd74950cd578984d5e23f7","last_reissued_at":"2026-05-18T01:03:31.092495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:31.092495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordering with precedence constraints and budget minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Akbar Rafiey, Arash Rafiey, J\\'an Manuch, Jeff Kinne","submitted_at":"2015-07-17T09:11:56Z","abstract_excerpt":"We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph $H=(B,S)$. Vertices in $B$ are thought of as goods or services that must be \\emph{bought} to produce items in $S$ that are to be \\emph{sold}. An edge from $j\\in S$ to $i\\in B$ indicates that the production of $j$ requires the purchase of $i$. Each vertex in $B$ has a cost, and each vertex in $S$ results in some gain. The goal is to obtain an ordering of $B\\cup S$ that respects the precedence constraints and maximizes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04885","kind":"arxiv","version":3},"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":"1507.04885","created_at":"2026-05-18T01:03:31.092636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04885v3","created_at":"2026-05-18T01:03:31.092636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04885","created_at":"2026-05-18T01:03:31.092636+00:00"},{"alias_kind":"pith_short_12","alias_value":"YF25PVY5X5IH","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YF25PVY5X5IHVY6H","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YF25PVY5","created_at":"2026-05-18T12:29:50.041715+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/YF25PVY5X5IHVY6HGMKVA6WYZA","json":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA.json","graph_json":"https://pith.science/api/pith-number/YF25PVY5X5IHVY6HGMKVA6WYZA/graph.json","events_json":"https://pith.science/api/pith-number/YF25PVY5X5IHVY6HGMKVA6WYZA/events.json","paper":"https://pith.science/paper/YF25PVY5"},"agent_actions":{"view_html":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA","download_json":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA.json","view_paper":"https://pith.science/paper/YF25PVY5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04885&json=true","fetch_graph":"https://pith.science/api/pith-number/YF25PVY5X5IHVY6HGMKVA6WYZA/graph.json","fetch_events":"https://pith.science/api/pith-number/YF25PVY5X5IHVY6HGMKVA6WYZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA/action/storage_attestation","attest_author":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA/action/author_attestation","sign_citation":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA/action/citation_signature","submit_replication":"https://pith.science/pith/YF25PVY5X5IHVY6HGMKVA6WYZA/action/replication_record"}},"created_at":"2026-05-18T01:03:31.092636+00:00","updated_at":"2026-05-18T01:03:31.092636+00:00"}