{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MBY3GBT2J3ELLLMT7BNKI2GDRD","short_pith_number":"pith:MBY3GBT2","canonical_record":{"source":{"id":"2507.13493","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-17T19:04:50Z","cross_cats_sorted":[],"title_canon_sha256":"d34c1016b9b8c5b11ae6f90d3fde1e3a6b3a34ceeca84ef4e6d0a8ea6229b3e2","abstract_canon_sha256":"fcf1dd065234f0b39a5341cdd6032ec6eafe75f5afaeb7489e3c17558cd51e41"},"schema_version":"1.0"},"canonical_sha256":"6071b3067a4ec8b5ad93f85aa468c388da7379e43f9d975d1f10e2b51ff95255","source":{"kind":"arxiv","id":"2507.13493","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13493","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13493v3","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13493","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"MBY3GBT2J3EL","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"MBY3GBT2J3ELLLMT","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"MBY3GBT2","created_at":"2026-05-20T01:04:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MBY3GBT2J3ELLLMT7BNKI2GDRD","target":"record","payload":{"canonical_record":{"source":{"id":"2507.13493","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-17T19:04:50Z","cross_cats_sorted":[],"title_canon_sha256":"d34c1016b9b8c5b11ae6f90d3fde1e3a6b3a34ceeca84ef4e6d0a8ea6229b3e2","abstract_canon_sha256":"fcf1dd065234f0b39a5341cdd6032ec6eafe75f5afaeb7489e3c17558cd51e41"},"schema_version":"1.0"},"canonical_sha256":"6071b3067a4ec8b5ad93f85aa468c388da7379e43f9d975d1f10e2b51ff95255","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:30.080569Z","signature_b64":"j7olPmIPXjTaRwILOjWdVf+dmg50xZGbz0WUdSnsDrJ8t/5pEk4P9asQqJDUoe4u1J1dW6gTzFZMS5QB5KYYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6071b3067a4ec8b5ad93f85aa468c388da7379e43f9d975d1f10e2b51ff95255","last_reissued_at":"2026-05-20T01:04:30.079659Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:30.079659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.13493","source_version":3,"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-20T01:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eopsyuPF03k4tVl5i/hD0k1UUQnTNsy5eLT4TGGcGJ5ng8+51lj/AaYA/XGvu/Waqo8AqsYUbFfufReYLCJ1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:00:38.476761Z"},"content_sha256":"8a9c0a3a635a141e9948c4d9ddc93820606139a10d371492d0cc8e9a3febd8f3","schema_version":"1.0","event_id":"sha256:8a9c0a3a635a141e9948c4d9ddc93820606139a10d371492d0cc8e9a3febd8f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MBY3GBT2J3ELLLMT7BNKI2GDRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Specialized Simplex Algorithm for Budget-Constrained Total Variation-Regularized Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dominic Yang","submitted_at":"2025-07-17T19:04:50Z","abstract_excerpt":"We consider a class of linear programs on graphs with total variation regularization and a budgetary constraint. For these programs, we give a characterization of basic solutions in terms of rooted spanning forests with orientation on the underlying graph. This leads to an interpretation of the simplex method in terms of simple graph operations on these underlying forests. We exploit this structure to produce an accelerated simplex method and empirically show that such improvements can lead to an order of magnitude improvement in time when compared to state-of-the-art solvers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13493","kind":"arxiv","version":3},"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/2507.13493/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-05-20T01:04:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZkBd4hYjoaabnIHO+m7TRvbIkjHIQTD2V4XKSuDRXWI5jkaqISC81GtsId1XLsOgqMSdvbQ/x2ZOiaOcouIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T13:00:38.477583Z"},"content_sha256":"1682b7b539585a76db11b03cc075d9c694a3f8ee38b7bd7d24abdb13dcf74535","schema_version":"1.0","event_id":"sha256:1682b7b539585a76db11b03cc075d9c694a3f8ee38b7bd7d24abdb13dcf74535"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD/bundle.json","state_url":"https://pith.science/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD/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-23T13:00:38Z","links":{"resolver":"https://pith.science/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD","bundle":"https://pith.science/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD/bundle.json","state":"https://pith.science/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBY3GBT2J3ELLLMT7BNKI2GDRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MBY3GBT2J3ELLLMT7BNKI2GDRD","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":"fcf1dd065234f0b39a5341cdd6032ec6eafe75f5afaeb7489e3c17558cd51e41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-17T19:04:50Z","title_canon_sha256":"d34c1016b9b8c5b11ae6f90d3fde1e3a6b3a34ceeca84ef4e6d0a8ea6229b3e2"},"schema_version":"1.0","source":{"id":"2507.13493","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13493","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13493v3","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13493","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_12","alias_value":"MBY3GBT2J3EL","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_16","alias_value":"MBY3GBT2J3ELLLMT","created_at":"2026-05-20T01:04:30Z"},{"alias_kind":"pith_short_8","alias_value":"MBY3GBT2","created_at":"2026-05-20T01:04:30Z"}],"graph_snapshots":[{"event_id":"sha256:1682b7b539585a76db11b03cc075d9c694a3f8ee38b7bd7d24abdb13dcf74535","target":"graph","created_at":"2026-05-20T01:04:30Z","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/2507.13493/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a class of linear programs on graphs with total variation regularization and a budgetary constraint. For these programs, we give a characterization of basic solutions in terms of rooted spanning forests with orientation on the underlying graph. This leads to an interpretation of the simplex method in terms of simple graph operations on these underlying forests. We exploit this structure to produce an accelerated simplex method and empirically show that such improvements can lead to an order of magnitude improvement in time when compared to state-of-the-art solvers.","authors_text":"Dominic Yang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-17T19:04:50Z","title":"A Specialized Simplex Algorithm for Budget-Constrained Total Variation-Regularized Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13493","kind":"arxiv","version":3},"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:8a9c0a3a635a141e9948c4d9ddc93820606139a10d371492d0cc8e9a3febd8f3","target":"record","created_at":"2026-05-20T01:04:30Z","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":"fcf1dd065234f0b39a5341cdd6032ec6eafe75f5afaeb7489e3c17558cd51e41","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-17T19:04:50Z","title_canon_sha256":"d34c1016b9b8c5b11ae6f90d3fde1e3a6b3a34ceeca84ef4e6d0a8ea6229b3e2"},"schema_version":"1.0","source":{"id":"2507.13493","kind":"arxiv","version":3}},"canonical_sha256":"6071b3067a4ec8b5ad93f85aa468c388da7379e43f9d975d1f10e2b51ff95255","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6071b3067a4ec8b5ad93f85aa468c388da7379e43f9d975d1f10e2b51ff95255","first_computed_at":"2026-05-20T01:04:30.079659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:04:30.079659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j7olPmIPXjTaRwILOjWdVf+dmg50xZGbz0WUdSnsDrJ8t/5pEk4P9asQqJDUoe4u1J1dW6gTzFZMS5QB5KYYAQ==","signature_status":"signed_v1","signed_at":"2026-05-20T01:04:30.080569Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.13493","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a9c0a3a635a141e9948c4d9ddc93820606139a10d371492d0cc8e9a3febd8f3","sha256:1682b7b539585a76db11b03cc075d9c694a3f8ee38b7bd7d24abdb13dcf74535"],"state_sha256":"1cea99d82d5f3efa59bfe356323e2c79e3c99cce8dd17dcc5e4bb00faf9d04eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+z5tvEn5+hyxO40rjv2ybaXup/7V9tsNraJZC47v1wVb5aogUbnOXYuHO/s4xZVtjiMlGvbUJ3QNGWO9EvBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T13:00:38.482504Z","bundle_sha256":"1bde814cec63cfe5960bb91ef290e7ee161f651fafb28d330f49de7db7cd0484"}}