{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BXQPBVFHJ7MFLP2IXT4IENNVEO","short_pith_number":"pith:BXQPBVFH","canonical_record":{"source":{"id":"1804.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-09T08:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"531921fec5f0c11f159ff7b68d10046d53f028a88447fb9c2a35b51a6ec809bd","abstract_canon_sha256":"0f508817852712afe74bec8d9b9df9111c43b7e8e7df2ba57b2d012b4fd8bd35"},"schema_version":"1.0"},"canonical_sha256":"0de0f0d4a74fd855bf48bcf88235b523ab987569c9bed42f22652bded53383ef","source":{"kind":"arxiv","id":"1804.02857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02857","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02857v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02857","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"BXQPBVFHJ7MF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BXQPBVFHJ7MFLP2I","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BXQPBVFH","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BXQPBVFHJ7MFLP2IXT4IENNVEO","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-09T08:02:43Z","cross_cats_sorted":[],"title_canon_sha256":"531921fec5f0c11f159ff7b68d10046d53f028a88447fb9c2a35b51a6ec809bd","abstract_canon_sha256":"0f508817852712afe74bec8d9b9df9111c43b7e8e7df2ba57b2d012b4fd8bd35"},"schema_version":"1.0"},"canonical_sha256":"0de0f0d4a74fd855bf48bcf88235b523ab987569c9bed42f22652bded53383ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:58.147070Z","signature_b64":"linvu7F5nKrjuYeNdy9DU0aYE7bJ0TwW4zUF+UJgg+mT6YdICuODwyqBlLyBDJqDEc18d9u3oc3OzvKrDsvVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de0f0d4a74fd855bf48bcf88235b523ab987569c9bed42f22652bded53383ef","last_reissued_at":"2026-05-18T00:18:58.146412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:58.146412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02857","source_version":1,"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:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXWq9AUIlKWx57dEILwekI0UcZC057OyudIf3yb9cxYF34K+hqOfaX2AySvgJsJRlQXXj1cq6k81X8SB6YCeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:46:44.510006Z"},"content_sha256":"b4cb3c341d97a863300c487cc7af3dd1c8e9fccb6f96b644c6ee21ff7fb5b011","schema_version":"1.0","event_id":"sha256:b4cb3c341d97a863300c487cc7af3dd1c8e9fccb6f96b644c6ee21ff7fb5b011"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BXQPBVFHJ7MFLP2IXT4IENNVEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Pooling Problems by LP and SOCP Relaxations and Rescheduling Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Makoto Yamashita, Masaki Kimizuka, Sunyoung Kim","submitted_at":"2018-04-09T08:02:43Z","abstract_excerpt":"The pooling problem is an important industrial problem in the class of network flow problems for allocating gas flow in pipeline transportation networks. For P-formulation of the pooling problem with time discretization, we propose second order cone programming (SOCP) and linear programming (LP) relaxations and prove that they obtain the same optimal value as the semidefinite programming relaxation. The equivalence among the optimal values of the three relaxations is also computationally shown. Moreover, a rescheduling method is proposed to efficiently refine the solution obtained by the SOCP "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02857","kind":"arxiv","version":1},"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:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yTiirxfa5D1O0leDXBIAMY7KBtqj73WQV7i3ZxyTLYslym6Hg5mbRudTG/42hifrdhY3VrVC5MiGW+RZOAhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:46:44.510637Z"},"content_sha256":"df7a924fc1d0813934185e86f89bd2c41b60f08a819a28a15d6074fe2009cd85","schema_version":"1.0","event_id":"sha256:df7a924fc1d0813934185e86f89bd2c41b60f08a819a28a15d6074fe2009cd85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO/bundle.json","state_url":"https://pith.science/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO/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-26T02:46:44Z","links":{"resolver":"https://pith.science/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO","bundle":"https://pith.science/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO/bundle.json","state":"https://pith.science/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXQPBVFHJ7MFLP2IXT4IENNVEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BXQPBVFHJ7MFLP2IXT4IENNVEO","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":"0f508817852712afe74bec8d9b9df9111c43b7e8e7df2ba57b2d012b4fd8bd35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-09T08:02:43Z","title_canon_sha256":"531921fec5f0c11f159ff7b68d10046d53f028a88447fb9c2a35b51a6ec809bd"},"schema_version":"1.0","source":{"id":"1804.02857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02857","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02857v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02857","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"BXQPBVFHJ7MF","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BXQPBVFHJ7MFLP2I","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BXQPBVFH","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:df7a924fc1d0813934185e86f89bd2c41b60f08a819a28a15d6074fe2009cd85","target":"graph","created_at":"2026-05-18T00:18:58Z","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":"The pooling problem is an important industrial problem in the class of network flow problems for allocating gas flow in pipeline transportation networks. For P-formulation of the pooling problem with time discretization, we propose second order cone programming (SOCP) and linear programming (LP) relaxations and prove that they obtain the same optimal value as the semidefinite programming relaxation. The equivalence among the optimal values of the three relaxations is also computationally shown. Moreover, a rescheduling method is proposed to efficiently refine the solution obtained by the SOCP ","authors_text":"Makoto Yamashita, Masaki Kimizuka, Sunyoung Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-09T08:02:43Z","title":"Solving Pooling Problems by LP and SOCP Relaxations and Rescheduling Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02857","kind":"arxiv","version":1},"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:b4cb3c341d97a863300c487cc7af3dd1c8e9fccb6f96b644c6ee21ff7fb5b011","target":"record","created_at":"2026-05-18T00:18:58Z","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":"0f508817852712afe74bec8d9b9df9111c43b7e8e7df2ba57b2d012b4fd8bd35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-09T08:02:43Z","title_canon_sha256":"531921fec5f0c11f159ff7b68d10046d53f028a88447fb9c2a35b51a6ec809bd"},"schema_version":"1.0","source":{"id":"1804.02857","kind":"arxiv","version":1}},"canonical_sha256":"0de0f0d4a74fd855bf48bcf88235b523ab987569c9bed42f22652bded53383ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0de0f0d4a74fd855bf48bcf88235b523ab987569c9bed42f22652bded53383ef","first_computed_at":"2026-05-18T00:18:58.146412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:58.146412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"linvu7F5nKrjuYeNdy9DU0aYE7bJ0TwW4zUF+UJgg+mT6YdICuODwyqBlLyBDJqDEc18d9u3oc3OzvKrDsvVBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:58.147070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4cb3c341d97a863300c487cc7af3dd1c8e9fccb6f96b644c6ee21ff7fb5b011","sha256:df7a924fc1d0813934185e86f89bd2c41b60f08a819a28a15d6074fe2009cd85"],"state_sha256":"149fde7b427e11b2e28ccd2b9c2038711aeb6a90d6193c4447f07a78e93159bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mH0GdHa+B1KcYZS7HLrN2sIbvJnFr0UffJ9LfHOdCXRWNNUX9mILL5i2j1HEPwKHt8cfXyU9i2+ac6IflmToAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:46:44.514860Z","bundle_sha256":"d138ea38ce88412256a1411ef61eaee49e636573502af5253a7e9b90faa6a3ec"}}