{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:THJ3JL747CCP7NVIGIB6WRIP4A","short_pith_number":"pith:THJ3JL74","canonical_record":{"source":{"id":"2403.14535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-21T16:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"4eaa4961c756d191cb793d932fb3843884e4a472a590df9c6c462ce8a976f08d","abstract_canon_sha256":"a2c3482c5fbfff0f5fc196117fd5386313b99d72d438f23c71c30fe30895937a"},"schema_version":"1.0"},"canonical_sha256":"99d3b4affcf884ffb6a83203eb450fe002b77cd64d107116b03c85b049b19290","source":{"kind":"arxiv","id":"2403.14535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.14535","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"2403.14535v1","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14535","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"THJ3JL747CCP","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"THJ3JL747CCP7NVI","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"THJ3JL74","created_at":"2026-07-05T07:59:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:THJ3JL747CCP7NVIGIB6WRIP4A","target":"record","payload":{"canonical_record":{"source":{"id":"2403.14535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-21T16:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"4eaa4961c756d191cb793d932fb3843884e4a472a590df9c6c462ce8a976f08d","abstract_canon_sha256":"a2c3482c5fbfff0f5fc196117fd5386313b99d72d438f23c71c30fe30895937a"},"schema_version":"1.0"},"canonical_sha256":"99d3b4affcf884ffb6a83203eb450fe002b77cd64d107116b03c85b049b19290","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:10.397122Z","signature_b64":"BGFzguIru9lIxIaLePzLwAX4PSnIp6oeekZiSAiOmQg3qw745/XHfM3iYLbHiysvhcWlbZPGzLD93P1+0RQdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99d3b4affcf884ffb6a83203eb450fe002b77cd64d107116b03c85b049b19290","last_reissued_at":"2026-07-05T07:59:10.396723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:10.396723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.14535","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-07-05T07:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRUpxgAZYm6jKRTMPL/pifAwm5CbgD+WgBngosxC4xUersiwWusND2DkqHu+SqQAFSxnnVua6pfjW9k/SqtWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:22:49.789064Z"},"content_sha256":"e072492f446647a9d60ac2962f97d11298a335019965c91123cacf8c6cb95b30","schema_version":"1.0","event_id":"sha256:e072492f446647a9d60ac2962f97d11298a335019965c91123cacf8c6cb95b30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:THJ3JL747CCP7NVIGIB6WRIP4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Methods for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu","submitted_at":"2024-03-21T16:37:34Z","abstract_excerpt":"Linear programming is the seminal optimization problem that has spawned and grown into today's rich and diverse optimization modeling and algorithmic landscape. This article provides an overview of the recent development of first-order methods for solving large-scale linear programming."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14535","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.14535/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sscQjN2nEo7Lg6pfiw/hdjbBON9OQuiE3O5EVpdrCJgsWlaiA23+LIJPjXg2m0FD2WZ3s47iU5IqGTfAfr9oCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:22:49.789573Z"},"content_sha256":"5ff3c5f9f55d0f46b5da6e53903832026f5b39892aaa822c1f2f44b4aee4629c","schema_version":"1.0","event_id":"sha256:5ff3c5f9f55d0f46b5da6e53903832026f5b39892aaa822c1f2f44b4aee4629c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THJ3JL747CCP7NVIGIB6WRIP4A/bundle.json","state_url":"https://pith.science/pith/THJ3JL747CCP7NVIGIB6WRIP4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THJ3JL747CCP7NVIGIB6WRIP4A/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-08-12T21:22:49Z","links":{"resolver":"https://pith.science/pith/THJ3JL747CCP7NVIGIB6WRIP4A","bundle":"https://pith.science/pith/THJ3JL747CCP7NVIGIB6WRIP4A/bundle.json","state":"https://pith.science/pith/THJ3JL747CCP7NVIGIB6WRIP4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THJ3JL747CCP7NVIGIB6WRIP4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:THJ3JL747CCP7NVIGIB6WRIP4A","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":"a2c3482c5fbfff0f5fc196117fd5386313b99d72d438f23c71c30fe30895937a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-21T16:37:34Z","title_canon_sha256":"4eaa4961c756d191cb793d932fb3843884e4a472a590df9c6c462ce8a976f08d"},"schema_version":"1.0","source":{"id":"2403.14535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.14535","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"2403.14535v1","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14535","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"THJ3JL747CCP","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"THJ3JL747CCP7NVI","created_at":"2026-07-05T07:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"THJ3JL74","created_at":"2026-07-05T07:59:10Z"}],"graph_snapshots":[{"event_id":"sha256:5ff3c5f9f55d0f46b5da6e53903832026f5b39892aaa822c1f2f44b4aee4629c","target":"graph","created_at":"2026-07-05T07:59: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.14535/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Linear programming is the seminal optimization problem that has spawned and grown into today's rich and diverse optimization modeling and algorithmic landscape. This article provides an overview of the recent development of first-order methods for solving large-scale linear programming.","authors_text":"Haihao Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-21T16:37:34Z","title":"First-Order Methods for Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14535","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:e072492f446647a9d60ac2962f97d11298a335019965c91123cacf8c6cb95b30","target":"record","created_at":"2026-07-05T07:59: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":"a2c3482c5fbfff0f5fc196117fd5386313b99d72d438f23c71c30fe30895937a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-21T16:37:34Z","title_canon_sha256":"4eaa4961c756d191cb793d932fb3843884e4a472a590df9c6c462ce8a976f08d"},"schema_version":"1.0","source":{"id":"2403.14535","kind":"arxiv","version":1}},"canonical_sha256":"99d3b4affcf884ffb6a83203eb450fe002b77cd64d107116b03c85b049b19290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99d3b4affcf884ffb6a83203eb450fe002b77cd64d107116b03c85b049b19290","first_computed_at":"2026-07-05T07:59:10.396723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:59:10.396723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BGFzguIru9lIxIaLePzLwAX4PSnIp6oeekZiSAiOmQg3qw745/XHfM3iYLbHiysvhcWlbZPGzLD93P1+0RQdBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:59:10.397122Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.14535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e072492f446647a9d60ac2962f97d11298a335019965c91123cacf8c6cb95b30","sha256:5ff3c5f9f55d0f46b5da6e53903832026f5b39892aaa822c1f2f44b4aee4629c"],"state_sha256":"fb1c22540e115f2ad9b7c7223b9c16fe717aa637a138afeef525bdac1438ee92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+OGXFzxPNSE3kqQ2VnlYGOXLakoX8fsO1KS89rNP/YqXiN3TuiUtUD3PlS8tNqpxogQ/0AWtVvWBVsV12Sn1DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:22:49.794603Z","bundle_sha256":"871eed66fef14b6682be79641128936fd592e4e317ef684ff72f8cc173acd8e7"}}