{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XNVDKH3VULMQ75K625T3YKJDC7","short_pith_number":"pith:XNVDKH3V","canonical_record":{"source":{"id":"1903.07469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T14:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"f5a252d64c27e01ee5d1b3e269f506ff8c68ca3b14e621611fa20557a8aa2887","abstract_canon_sha256":"6aa9a798866b7370a060f27f6323937c34174d9095fd3dd5e66dcb4edcd53f97"},"schema_version":"1.0"},"canonical_sha256":"bb6a351f75a2d90ff55ed767bc292317d8b5b351c504276e8512eed487f9b514","source":{"kind":"arxiv","id":"1903.07469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07469","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07469v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07469","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"XNVDKH3VULMQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XNVDKH3VULMQ75K6","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XNVDKH3V","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XNVDKH3VULMQ75K625T3YKJDC7","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T14:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"f5a252d64c27e01ee5d1b3e269f506ff8c68ca3b14e621611fa20557a8aa2887","abstract_canon_sha256":"6aa9a798866b7370a060f27f6323937c34174d9095fd3dd5e66dcb4edcd53f97"},"schema_version":"1.0"},"canonical_sha256":"bb6a351f75a2d90ff55ed767bc292317d8b5b351c504276e8512eed487f9b514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.338341Z","signature_b64":"O2kvqLj0xYi9tm8CIQYrWxPQHVa1N4IO88930vA6h1bsCNUiTtwUuUQZZE0bkSyQRLkD7MlGiCFtXcXiv9RiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb6a351f75a2d90ff55ed767bc292317d8b5b351c504276e8512eed487f9b514","last_reissued_at":"2026-05-17T23:51:01.337714Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.337714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07469","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crBAHaZFG+ezZ6Wh2B/GqVrBXL03Nadqf0d+hGrw+5XYWqf+zGloQC1tkAqMGChSkN4H6IeSv6qNl1QiocdECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:10:27.905703Z"},"content_sha256":"836ec525ce7aa7503a8161b8ff8646845399d3e09f026a50d09812c20d8c5cd6","schema_version":"1.0","event_id":"sha256:836ec525ce7aa7503a8161b8ff8646845399d3e09f026a50d09812c20d8c5cd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XNVDKH3VULMQ75K625T3YKJDC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Splitted Multi-Commodity Flow Problem by Efficient Linear Programming Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hengjun Zhao, Liyun Dai, Zhiming Liu","submitted_at":"2019-03-18T14:24:07Z","abstract_excerpt":"Column generation is often used to solve multi-commodity flow problems. A program for column generation always includes a module that solves a linear equation. In this paper, we address three major issues in solving linear problem during column generation procedure which are (1) how to employ the sparse property of the coefficient matrix; (2) how to reduce the size of the coefficient matrix; and (3) how to reuse the solution to a similar equation. To this end, we first analyze the sparse property of coefficient matrix of linear equations and find that the matrices occurring in iteration are ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07469","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rk+yUJLlZOiOvRhYFKaonOyCMmFu/GNPifVbJqObqX7eSb8G8AQdQswCeHn3Cho+kqASdk4BO3f+8SQiVAgACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:10:27.906074Z"},"content_sha256":"5a02b6197897c012c30eb1dcbd0e1eec8a9fc5e81cbf58f5ebac08e9c6e2d8dc","schema_version":"1.0","event_id":"sha256:5a02b6197897c012c30eb1dcbd0e1eec8a9fc5e81cbf58f5ebac08e9c6e2d8dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNVDKH3VULMQ75K625T3YKJDC7/bundle.json","state_url":"https://pith.science/pith/XNVDKH3VULMQ75K625T3YKJDC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNVDKH3VULMQ75K625T3YKJDC7/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-06-02T15:10:27Z","links":{"resolver":"https://pith.science/pith/XNVDKH3VULMQ75K625T3YKJDC7","bundle":"https://pith.science/pith/XNVDKH3VULMQ75K625T3YKJDC7/bundle.json","state":"https://pith.science/pith/XNVDKH3VULMQ75K625T3YKJDC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNVDKH3VULMQ75K625T3YKJDC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XNVDKH3VULMQ75K625T3YKJDC7","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":"6aa9a798866b7370a060f27f6323937c34174d9095fd3dd5e66dcb4edcd53f97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T14:24:07Z","title_canon_sha256":"f5a252d64c27e01ee5d1b3e269f506ff8c68ca3b14e621611fa20557a8aa2887"},"schema_version":"1.0","source":{"id":"1903.07469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07469","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07469v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07469","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"XNVDKH3VULMQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XNVDKH3VULMQ75K6","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XNVDKH3V","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:5a02b6197897c012c30eb1dcbd0e1eec8a9fc5e81cbf58f5ebac08e9c6e2d8dc","target":"graph","created_at":"2026-05-17T23:51:01Z","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":"Column generation is often used to solve multi-commodity flow problems. A program for column generation always includes a module that solves a linear equation. In this paper, we address three major issues in solving linear problem during column generation procedure which are (1) how to employ the sparse property of the coefficient matrix; (2) how to reduce the size of the coefficient matrix; and (3) how to reuse the solution to a similar equation. To this end, we first analyze the sparse property of coefficient matrix of linear equations and find that the matrices occurring in iteration are ve","authors_text":"Hengjun Zhao, Liyun Dai, Zhiming Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T14:24:07Z","title":"Solving Splitted Multi-Commodity Flow Problem by Efficient Linear Programming Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07469","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:836ec525ce7aa7503a8161b8ff8646845399d3e09f026a50d09812c20d8c5cd6","target":"record","created_at":"2026-05-17T23:51:01Z","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":"6aa9a798866b7370a060f27f6323937c34174d9095fd3dd5e66dcb4edcd53f97","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T14:24:07Z","title_canon_sha256":"f5a252d64c27e01ee5d1b3e269f506ff8c68ca3b14e621611fa20557a8aa2887"},"schema_version":"1.0","source":{"id":"1903.07469","kind":"arxiv","version":1}},"canonical_sha256":"bb6a351f75a2d90ff55ed767bc292317d8b5b351c504276e8512eed487f9b514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb6a351f75a2d90ff55ed767bc292317d8b5b351c504276e8512eed487f9b514","first_computed_at":"2026-05-17T23:51:01.337714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:01.337714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O2kvqLj0xYi9tm8CIQYrWxPQHVa1N4IO88930vA6h1bsCNUiTtwUuUQZZE0bkSyQRLkD7MlGiCFtXcXiv9RiCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:01.338341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:836ec525ce7aa7503a8161b8ff8646845399d3e09f026a50d09812c20d8c5cd6","sha256:5a02b6197897c012c30eb1dcbd0e1eec8a9fc5e81cbf58f5ebac08e9c6e2d8dc"],"state_sha256":"d40ac6322c4521b5a732837a0445299c2dc7de497ad4d8b3c584d5c2498aece1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRT9G8tsQWAyngXYz0sRaI6SlmEpYL5kZHaNpJkwgntU5bxDNXezuGnKKm6JPK5nIcMrdCs/JD/p4x/JXzlUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:10:27.907990Z","bundle_sha256":"ebd69f6f09b8a4d8c6c666a55de5050634c8bde947269f29ed956681e0543362"}}