{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4JUZVK6QPE6AS7ZMYWN55A5Q5P","short_pith_number":"pith:4JUZVK6Q","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"},"canonical_sha256":"e2699aabd0793c097f2cc59bde83b0ebfc649888bdfe304ac8a400f2c27c5067","source":{"kind":"arxiv","id":"1508.03181","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03181","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03181v4","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03181","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"4JUZVK6QPE6A","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4JUZVK6QPE6AS7ZM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4JUZVK6Q","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4JUZVK6QPE6AS7ZMYWN55A5Q5P","target":"record","payload":{"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"},"canonical_sha256":"e2699aabd0793c097f2cc59bde83b0ebfc649888bdfe304ac8a400f2c27c5067","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"},"source_kind":"arxiv","source_id":"1508.03181","source_version":4,"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-18T00:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXoAm/VBZFjsEcotu52bgEBayj3En634qXXDwC2Hzwr/8IMG86afO6r+XPv29GbvT3HaoCMqFa7NaA744K5fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:59:38.388112Z"},"content_sha256":"13f31b2521c5ca8fa8cb6cb4697ef449a781e89acdea949cdb347e94d38513d9","schema_version":"1.0","event_id":"sha256:13f31b2521c5ca8fa8cb6cb4697ef449a781e89acdea949cdb347e94d38513d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4JUZVK6QPE6AS7ZMYWN55A5Q5P","target":"graph","payload":{"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"},"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-18T00:51:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sog2kdTIQ4PKfXnIV/lK9v60lEGEvxmaphJnDYPgsjxpGyfcQcbcnRP56rnOS8Tdnt99vmJZfzq91498S/JiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:59:38.388491Z"},"content_sha256":"d0479d029edbf5ffca1e80c4114adbcb5fe7002a6bf51b15a811e5c65a4090e6","schema_version":"1.0","event_id":"sha256:d0479d029edbf5ffca1e80c4114adbcb5fe7002a6bf51b15a811e5c65a4090e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/bundle.json","state_url":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/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-31T09:59:38Z","links":{"resolver":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P","bundle":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/bundle.json","state":"https://pith.science/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JUZVK6QPE6AS7ZMYWN55A5Q5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4JUZVK6QPE6AS7ZMYWN55A5Q5P","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":"b460f410cf314591219e026781a29162f8d9a140d9be63e9627b8c5ec1c5e2ff","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-13T11:48:13Z","title_canon_sha256":"ea88631247052e0dd1da4b6a40373059c67bff64eda2b60c0773dca0f5bafaa9"},"schema_version":"1.0","source":{"id":"1508.03181","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03181","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03181v4","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03181","created_at":"2026-05-18T00:51:07Z"},{"alias_kind":"pith_short_12","alias_value":"4JUZVK6QPE6A","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4JUZVK6QPE6AS7ZM","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4JUZVK6Q","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:d0479d029edbf5ffca1e80c4114adbcb5fe7002a6bf51b15a811e5c65a4090e6","target":"graph","created_at":"2026-05-18T00:51:07Z","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":"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.","authors_text":"Fabian Rigterink, Natashia Boland, Thomas Kalinowski","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-13T11:48:13Z","title":"A polynomially solvable case of the pooling problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03181","kind":"arxiv","version":4},"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:13f31b2521c5ca8fa8cb6cb4697ef449a781e89acdea949cdb347e94d38513d9","target":"record","created_at":"2026-05-18T00:51:07Z","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":"b460f410cf314591219e026781a29162f8d9a140d9be63e9627b8c5ec1c5e2ff","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-13T11:48:13Z","title_canon_sha256":"ea88631247052e0dd1da4b6a40373059c67bff64eda2b60c0773dca0f5bafaa9"},"schema_version":"1.0","source":{"id":"1508.03181","kind":"arxiv","version":4}},"canonical_sha256":"e2699aabd0793c097f2cc59bde83b0ebfc649888bdfe304ac8a400f2c27c5067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2699aabd0793c097f2cc59bde83b0ebfc649888bdfe304ac8a400f2c27c5067","first_computed_at":"2026-05-18T00:51:07.552057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:07.552057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"licYH25KqkYyKRVFM0DKGcinHPFXoP1Jg7Z+WcN351xLkd8XI47RyF4XmcmPropXtU9a7brBO6l01EptVvsEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:07.552512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03181","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f31b2521c5ca8fa8cb6cb4697ef449a781e89acdea949cdb347e94d38513d9","sha256:d0479d029edbf5ffca1e80c4114adbcb5fe7002a6bf51b15a811e5c65a4090e6"],"state_sha256":"7575fd0d47e4334a276db79af144e174a2616c3d3261b0320d501e48ec7fc5ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtvtS9vTDqJgVZTb14yapKkKJREdn8lqiMtVD6CKr0zhoVv5GTKfVJ9piaMlQM9KVN7jKtp5fY50TjfID4QIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:59:38.391610Z","bundle_sha256":"edbae428ec770c8777bb116b89f065d32b89818add122841be1b58b3764bf989"}}