{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GPNBXNVUOH6ISJV27IG5AXC7BE","short_pith_number":"pith:GPNBXNVU","canonical_record":{"source":{"id":"1901.03633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-11T16:22:26Z","cross_cats_sorted":[],"title_canon_sha256":"d6c1a911251946413a7c833062a868f9d21bf67b076c2617865e1a365b642fed","abstract_canon_sha256":"f239090d4871ecd7da024f270565bc03ac1e3acf20043f61bcb181c101177bd6"},"schema_version":"1.0"},"canonical_sha256":"33da1bb6b471fc8926bafa0dd05c5f09388f6ce3594a49fb2c52bc134ab539e3","source":{"kind":"arxiv","id":"1901.03633","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03633","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03633v2","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03633","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"GPNBXNVUOH6I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GPNBXNVUOH6ISJV2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GPNBXNVU","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GPNBXNVUOH6ISJV27IG5AXC7BE","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-11T16:22:26Z","cross_cats_sorted":[],"title_canon_sha256":"d6c1a911251946413a7c833062a868f9d21bf67b076c2617865e1a365b642fed","abstract_canon_sha256":"f239090d4871ecd7da024f270565bc03ac1e3acf20043f61bcb181c101177bd6"},"schema_version":"1.0"},"canonical_sha256":"33da1bb6b471fc8926bafa0dd05c5f09388f6ce3594a49fb2c52bc134ab539e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:11.358548Z","signature_b64":"vX+BaRIGRnBuiVgx/9C4+kvha3mc9Vnh1B4BFzW1PKPFDC2yoKfeCRFH9DxPIdhyVy1vIZ26DULg3g3O6Xe2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33da1bb6b471fc8926bafa0dd05c5f09388f6ce3594a49fb2c52bc134ab539e3","last_reissued_at":"2026-05-17T23:40:11.357860Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:11.357860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03633","source_version":2,"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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qxv9pi8AhE0g/gFjrb1OY2xOZfURJCg8rHV9CsPLGVPvKqoty+uswHEhVE5ueAtj5vDFzYZY2eDUZ4dy5SMhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:45:21.024210Z"},"content_sha256":"b66a4cde31442ed9f9d9700bb28614b0c8b633b90f3c931869e5320db6cf0e40","schema_version":"1.0","event_id":"sha256:b66a4cde31442ed9f9d9700bb28614b0c8b633b90f3c931869e5320db6cf0e40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GPNBXNVUOH6ISJV27IG5AXC7BE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving linear programs on factorized databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Florent Capelli, Jan Ramon, Joachim Niehren, Nicolas Crosetti","submitted_at":"2019-01-11T16:22:26Z","abstract_excerpt":"A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the solver on this program while providing the data. When the data is extracted using a query on a database, this approach ignores the underlying structure of the answer set which may result in a blow-up of the size of the linear program if the answer set is big. In this paper, we study the problem of solving linear programming problems whose variables are the answers to a conjunctive query. We show that one can exploit th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03633","kind":"arxiv","version":2},"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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUpDzjWM0mwZgLse3f6BO9mTevhsyXKI1pGxpMWMPQdimhrh95iemXaI4dAPVtFMEMJg/bchgyULW3+VbaKbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:45:21.024578Z"},"content_sha256":"a9d63b7c29c29fcd1588f0495ca6c85ae2f5bb64f6f986c29be7f37b99939427","schema_version":"1.0","event_id":"sha256:a9d63b7c29c29fcd1588f0495ca6c85ae2f5bb64f6f986c29be7f37b99939427"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPNBXNVUOH6ISJV27IG5AXC7BE/bundle.json","state_url":"https://pith.science/pith/GPNBXNVUOH6ISJV27IG5AXC7BE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPNBXNVUOH6ISJV27IG5AXC7BE/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-09T09:45:21Z","links":{"resolver":"https://pith.science/pith/GPNBXNVUOH6ISJV27IG5AXC7BE","bundle":"https://pith.science/pith/GPNBXNVUOH6ISJV27IG5AXC7BE/bundle.json","state":"https://pith.science/pith/GPNBXNVUOH6ISJV27IG5AXC7BE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPNBXNVUOH6ISJV27IG5AXC7BE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GPNBXNVUOH6ISJV27IG5AXC7BE","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":"f239090d4871ecd7da024f270565bc03ac1e3acf20043f61bcb181c101177bd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-11T16:22:26Z","title_canon_sha256":"d6c1a911251946413a7c833062a868f9d21bf67b076c2617865e1a365b642fed"},"schema_version":"1.0","source":{"id":"1901.03633","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03633","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03633v2","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03633","created_at":"2026-05-17T23:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"GPNBXNVUOH6I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GPNBXNVUOH6ISJV2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GPNBXNVU","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:a9d63b7c29c29fcd1588f0495ca6c85ae2f5bb64f6f986c29be7f37b99939427","target":"graph","created_at":"2026-05-17T23:40:11Z","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":"A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the solver on this program while providing the data. When the data is extracted using a query on a database, this approach ignores the underlying structure of the answer set which may result in a blow-up of the size of the linear program if the answer set is big. In this paper, we study the problem of solving linear programming problems whose variables are the answers to a conjunctive query. We show that one can exploit th","authors_text":"Florent Capelli, Jan Ramon, Joachim Niehren, Nicolas Crosetti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-11T16:22:26Z","title":"Solving linear programs on factorized databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03633","kind":"arxiv","version":2},"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:b66a4cde31442ed9f9d9700bb28614b0c8b633b90f3c931869e5320db6cf0e40","target":"record","created_at":"2026-05-17T23:40:11Z","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":"f239090d4871ecd7da024f270565bc03ac1e3acf20043f61bcb181c101177bd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-11T16:22:26Z","title_canon_sha256":"d6c1a911251946413a7c833062a868f9d21bf67b076c2617865e1a365b642fed"},"schema_version":"1.0","source":{"id":"1901.03633","kind":"arxiv","version":2}},"canonical_sha256":"33da1bb6b471fc8926bafa0dd05c5f09388f6ce3594a49fb2c52bc134ab539e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33da1bb6b471fc8926bafa0dd05c5f09388f6ce3594a49fb2c52bc134ab539e3","first_computed_at":"2026-05-17T23:40:11.357860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:11.357860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vX+BaRIGRnBuiVgx/9C4+kvha3mc9Vnh1B4BFzW1PKPFDC2yoKfeCRFH9DxPIdhyVy1vIZ26DULg3g3O6Xe2AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:11.358548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03633","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b66a4cde31442ed9f9d9700bb28614b0c8b633b90f3c931869e5320db6cf0e40","sha256:a9d63b7c29c29fcd1588f0495ca6c85ae2f5bb64f6f986c29be7f37b99939427"],"state_sha256":"611e5ee0e93309c5888c5839339c3c3ce357603859747898ed20ffe0ba5fe041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cvjXc//UTy/c3JlnAThl2Wy7cTA3Yr/bci1rdVtykVj+K1vZtbVDHNlUJMW98iweOXgjZ7sPQZrVZvl9fythBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:45:21.026376Z","bundle_sha256":"800be71f4ec3e62b355715af9469e2f6065d806f99627ab139470beee7e45ce4"}}