{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QDYDOPAP7DRCVSKYBP6AMISBFL","short_pith_number":"pith:QDYDOPAP","canonical_record":{"source":{"id":"1809.07890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-20T23:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"a1249f55cc3fe2c80aeca98d2405ea54ef4532fc63c5ae7be77d8a8fabcc9e8a","abstract_canon_sha256":"42d64f477330694d10d563cfec337ab868bb74105e4c01393561297a8bb71dc9"},"schema_version":"1.0"},"canonical_sha256":"80f0373c0ff8e22ac9580bfc0622412aca13faca67c38941ccee3f65b6e16802","source":{"kind":"arxiv","id":"1809.07890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07890","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07890v1","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07890","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"QDYDOPAP7DRC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QDYDOPAP7DRCVSKY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QDYDOPAP","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QDYDOPAP7DRCVSKYBP6AMISBFL","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-20T23:26:04Z","cross_cats_sorted":[],"title_canon_sha256":"a1249f55cc3fe2c80aeca98d2405ea54ef4532fc63c5ae7be77d8a8fabcc9e8a","abstract_canon_sha256":"42d64f477330694d10d563cfec337ab868bb74105e4c01393561297a8bb71dc9"},"schema_version":"1.0"},"canonical_sha256":"80f0373c0ff8e22ac9580bfc0622412aca13faca67c38941ccee3f65b6e16802","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:10.989347Z","signature_b64":"gdGUWFLCaYuFNOFcUwod4sPrlT9bN8k+5lg2JLABJzIi0DtNiZhlh1CD/0EGdU6r9yfHApsK8dfClgJgOiGBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80f0373c0ff8e22ac9580bfc0622412aca13faca67c38941ccee3f65b6e16802","last_reissued_at":"2026-05-18T00:05:10.988815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:10.988815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07890","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:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YerJ3XH1y5VbXYn3jPvXWBNuiftsnoy10QXTj5Fv/GNz1cc1luR87kwJ5RfUPAAoa+Lqs0I2Wjq9U7Em/PbiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:10:35.975812Z"},"content_sha256":"2457b402cc450be94332ea6f87ee57a0796dd1dd7c2555da03d78ca1d22d1dad","schema_version":"1.0","event_id":"sha256:2457b402cc450be94332ea6f87ee57a0796dd1dd7c2555da03d78ca1d22d1dad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QDYDOPAP7DRCVSKYBP6AMISBFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A non-iterative method for optimizing linear functions in convex linearly constrained spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Gerardo L. Febres","submitted_at":"2018-09-20T23:26:04Z","abstract_excerpt":"This document introduces a strategy to solve linear optimization problems. The strategy is based on the bounding condition each constraint produces on each one of the problem's dimension. The solution of a linear optimization problem is located at the intersection of the constraints defining the extreme vertex. By identifying the constraints that limit the growth of the objective function value, we formulate linear equations system leading to the optimization problem's solution.The most complex operation of the algorithm is the inversion of a matrix sized by the number of dimensions of the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07890","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:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWgsSBYM3OjPwVJ+OZlHi0ebA3kP2XAF54+5o0DizdjaQYeMghIkiG6XUEyat3iQD5IS9zHEQIaeudBK2wryCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:10:35.976568Z"},"content_sha256":"a8a8c3cfd8b23d18238a2bdb4fde9de0b4419d069c2699c45191c027843100dc","schema_version":"1.0","event_id":"sha256:a8a8c3cfd8b23d18238a2bdb4fde9de0b4419d069c2699c45191c027843100dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDYDOPAP7DRCVSKYBP6AMISBFL/bundle.json","state_url":"https://pith.science/pith/QDYDOPAP7DRCVSKYBP6AMISBFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDYDOPAP7DRCVSKYBP6AMISBFL/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-05T21:10:35Z","links":{"resolver":"https://pith.science/pith/QDYDOPAP7DRCVSKYBP6AMISBFL","bundle":"https://pith.science/pith/QDYDOPAP7DRCVSKYBP6AMISBFL/bundle.json","state":"https://pith.science/pith/QDYDOPAP7DRCVSKYBP6AMISBFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDYDOPAP7DRCVSKYBP6AMISBFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QDYDOPAP7DRCVSKYBP6AMISBFL","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":"42d64f477330694d10d563cfec337ab868bb74105e4c01393561297a8bb71dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-20T23:26:04Z","title_canon_sha256":"a1249f55cc3fe2c80aeca98d2405ea54ef4532fc63c5ae7be77d8a8fabcc9e8a"},"schema_version":"1.0","source":{"id":"1809.07890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07890","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07890v1","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07890","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"QDYDOPAP7DRC","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QDYDOPAP7DRCVSKY","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QDYDOPAP","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:a8a8c3cfd8b23d18238a2bdb4fde9de0b4419d069c2699c45191c027843100dc","target":"graph","created_at":"2026-05-18T00:05:10Z","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":"This document introduces a strategy to solve linear optimization problems. The strategy is based on the bounding condition each constraint produces on each one of the problem's dimension. The solution of a linear optimization problem is located at the intersection of the constraints defining the extreme vertex. By identifying the constraints that limit the growth of the objective function value, we formulate linear equations system leading to the optimization problem's solution.The most complex operation of the algorithm is the inversion of a matrix sized by the number of dimensions of the pro","authors_text":"Gerardo L. Febres","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-20T23:26:04Z","title":"A non-iterative method for optimizing linear functions in convex linearly constrained spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07890","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:2457b402cc450be94332ea6f87ee57a0796dd1dd7c2555da03d78ca1d22d1dad","target":"record","created_at":"2026-05-18T00:05:10Z","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":"42d64f477330694d10d563cfec337ab868bb74105e4c01393561297a8bb71dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-20T23:26:04Z","title_canon_sha256":"a1249f55cc3fe2c80aeca98d2405ea54ef4532fc63c5ae7be77d8a8fabcc9e8a"},"schema_version":"1.0","source":{"id":"1809.07890","kind":"arxiv","version":1}},"canonical_sha256":"80f0373c0ff8e22ac9580bfc0622412aca13faca67c38941ccee3f65b6e16802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80f0373c0ff8e22ac9580bfc0622412aca13faca67c38941ccee3f65b6e16802","first_computed_at":"2026-05-18T00:05:10.988815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:10.988815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gdGUWFLCaYuFNOFcUwod4sPrlT9bN8k+5lg2JLABJzIi0DtNiZhlh1CD/0EGdU6r9yfHApsK8dfClgJgOiGBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:10.989347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2457b402cc450be94332ea6f87ee57a0796dd1dd7c2555da03d78ca1d22d1dad","sha256:a8a8c3cfd8b23d18238a2bdb4fde9de0b4419d069c2699c45191c027843100dc"],"state_sha256":"b2b5ee3aa2c989c844aabf5c98b3c193c3ac450811e74f08d9b2251be71e4868"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWZmRjoPEkfq/w6zXIoca2o4etRGzFXss19p+HuvaEc/T9OLi+Isn7z4HIqXiLsPwgRDc8i43xQQdw6BmFIuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:10:35.980462Z","bundle_sha256":"05bf4c6bc3f20583f3da5c6ddd97c0f22bbca17ffc6fa0f77f63129ebfbc8933"}}