{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4JUZVK6QPE6AS7ZMYWN55A5Q5P","short_pith_number":"pith:4JUZVK6Q","schema_version":"1.0","canonical_sha256":"e2699aabd0793c097f2cc59bde83b0ebfc649888bdfe304ac8a400f2c27c5067","source":{"kind":"arxiv","id":"1508.03181","version":4},"attestation_state":"computed","paper":{"title":"A polynomially solvable case of the pooling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Fabian Rigterink, Natashia Boland, Thomas Kalinowski","submitted_at":"2015-08-13T11:48:13Z","abstract_excerpt":"Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem."},"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":"1508.03181","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-13T11:48:13Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"ea88631247052e0dd1da4b6a40373059c67bff64eda2b60c0773dca0f5bafaa9","abstract_canon_sha256":"b460f410cf314591219e026781a29162f8d9a140d9be63e9627b8c5ec1c5e2ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:07.552512Z","signature_b64":"licYH25KqkYyKRVFM0DKGcinHPFXoP1Jg7Z+WcN351xLkd8XI47RyF4XmcmPropXtU9a7brBO6l01EptVvsEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2699aabd0793c097f2cc59bde83b0ebfc649888bdfe304ac8a400f2c27c5067","last_reissued_at":"2026-05-18T00:51:07.552057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:07.552057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomially solvable case of the pooling problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Fabian Rigterink, Natashia Boland, Thomas Kalinowski","submitted_at":"2015-08-13T11:48:13Z","abstract_excerpt":"Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03181","kind":"arxiv","version":4},"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":"1508.03181","created_at":"2026-05-18T00:51:07.552137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03181v4","created_at":"2026-05-18T00:51:07.552137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03181","created_at":"2026-05-18T00:51:07.552137+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JUZVK6QPE6A","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JUZVK6QPE6AS7ZM","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JUZVK6Q","created_at":"2026-05-18T12:29:05.191682+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/4JUZVK6QPE6AS7ZMYWN55A5Q5P","json":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P.json","graph_json":"https://pith.science/api/pith-number/4JUZVK6QPE6AS7ZMYWN55A5Q5P/graph.json","events_json":"https://pith.science/api/pith-number/4JUZVK6QPE6AS7ZMYWN55A5Q5P/events.json","paper":"https://pith.science/paper/4JUZVK6Q"},"agent_actions":{"view_html":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P","download_json":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P.json","view_paper":"https://pith.science/paper/4JUZVK6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03181&json=true","fetch_graph":"https://pith.science/api/pith-number/4JUZVK6QPE6AS7ZMYWN55A5Q5P/graph.json","fetch_events":"https://pith.science/api/pith-number/4JUZVK6QPE6AS7ZMYWN55A5Q5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/action/storage_attestation","attest_author":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/action/author_attestation","sign_citation":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/action/citation_signature","submit_replication":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/action/replication_record"}},"created_at":"2026-05-18T00:51:07.552137+00:00","updated_at":"2026-05-18T00:51:07.552137+00:00"}