{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:76OIGT2TSFIGLIGK65I6DOESPO","short_pith_number":"pith:76OIGT2T","canonical_record":{"source":{"id":"1601.04175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-16T15:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"0c2c1e02894b23e9c553b35e269d6513ab6becbce21d6986c2b6264c934c61fe","abstract_canon_sha256":"1de2961319404bd2c5c2d75f90afbbf2bfc246f20ff6499564d18f46724de37b"},"schema_version":"1.0"},"canonical_sha256":"ff9c834f53915065a0caf751e1b8927b97001a4822f83254c7a9092ea50f8847","source":{"kind":"arxiv","id":"1601.04175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04175","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04175v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04175","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"76OIGT2TSFIG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"76OIGT2TSFIGLIGK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"76OIGT2T","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:76OIGT2TSFIGLIGK65I6DOESPO","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04175","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-16T15:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"0c2c1e02894b23e9c553b35e269d6513ab6becbce21d6986c2b6264c934c61fe","abstract_canon_sha256":"1de2961319404bd2c5c2d75f90afbbf2bfc246f20ff6499564d18f46724de37b"},"schema_version":"1.0"},"canonical_sha256":"ff9c834f53915065a0caf751e1b8927b97001a4822f83254c7a9092ea50f8847","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:45.733945Z","signature_b64":"r4OOP1krrakkMMfQD8dMEPosvht+HR4YlKaziC1BCu+gJNnDag+1PfSZdLgBEYteR2nk2JIc9O01/xp2H8oIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9c834f53915065a0caf751e1b8927b97001a4822f83254c7a9092ea50f8847","last_reissued_at":"2026-05-18T01:22:45.733418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:45.733418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04175","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-18T01:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1F7mRjpP3lsdMlQbakxWtyycpQw8zwHMgwZoCi2FZCLD4jcj//Pecuca+thlJUIoD9XrOk4zGqLxuTNNWsuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:43:02.613305Z"},"content_sha256":"3046bc863411bb3639d8e308ae21248beedaeff782d81c9b7c90b51efbfa76fd","schema_version":"1.0","event_id":"sha256:3046bc863411bb3639d8e308ae21248beedaeff782d81c9b7c90b51efbfa76fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:76OIGT2TSFIGLIGK65I6DOESPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Analysis of Primal-Dual Algorithms for Discounted Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Randy Cogill","submitted_at":"2016-01-16T15:31:29Z","abstract_excerpt":"Several well-known algorithms in the field of combinatorial optimization can be interpreted in terms of the primal-dual method for solving linear programs. For example, Dijkstra's algorithm, the Ford-Fulkerson algorithm, and the Hungarian algorithm can all be viewed as the primal-dual method applied to the linear programming formulations of their respective optimization problems. Roughly speaking, successfully applying the primal-dual method to an optimization problem that can be posed as a linear program relies on the ability to find a simple characterization of the optimal solutions to a rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04175","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-18T01:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzVTcYWnVSkvAuDz1Q2hqF7GUyB1iYnhStSu+1hwSH3lXpBrE10FO93x3YeltIvoozM/kJX8VVZJUeV5i1p7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:43:02.613667Z"},"content_sha256":"ad0c0d333caa2023912bce499092c384e154134799e7f93e51605b242d033968","schema_version":"1.0","event_id":"sha256:ad0c0d333caa2023912bce499092c384e154134799e7f93e51605b242d033968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/bundle.json","state_url":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76OIGT2TSFIGLIGK65I6DOESPO/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-27T00:43:02Z","links":{"resolver":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO","bundle":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/bundle.json","state":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76OIGT2TSFIGLIGK65I6DOESPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:76OIGT2TSFIGLIGK65I6DOESPO","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":"1de2961319404bd2c5c2d75f90afbbf2bfc246f20ff6499564d18f46724de37b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-16T15:31:29Z","title_canon_sha256":"0c2c1e02894b23e9c553b35e269d6513ab6becbce21d6986c2b6264c934c61fe"},"schema_version":"1.0","source":{"id":"1601.04175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04175","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04175v1","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04175","created_at":"2026-05-18T01:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"76OIGT2TSFIG","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"76OIGT2TSFIGLIGK","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"76OIGT2T","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:ad0c0d333caa2023912bce499092c384e154134799e7f93e51605b242d033968","target":"graph","created_at":"2026-05-18T01:22:45Z","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":"Several well-known algorithms in the field of combinatorial optimization can be interpreted in terms of the primal-dual method for solving linear programs. For example, Dijkstra's algorithm, the Ford-Fulkerson algorithm, and the Hungarian algorithm can all be viewed as the primal-dual method applied to the linear programming formulations of their respective optimization problems. Roughly speaking, successfully applying the primal-dual method to an optimization problem that can be posed as a linear program relies on the ability to find a simple characterization of the optimal solutions to a rel","authors_text":"Randy Cogill","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-16T15:31:29Z","title":"An Analysis of Primal-Dual Algorithms for Discounted Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04175","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:3046bc863411bb3639d8e308ae21248beedaeff782d81c9b7c90b51efbfa76fd","target":"record","created_at":"2026-05-18T01:22:45Z","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":"1de2961319404bd2c5c2d75f90afbbf2bfc246f20ff6499564d18f46724de37b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-16T15:31:29Z","title_canon_sha256":"0c2c1e02894b23e9c553b35e269d6513ab6becbce21d6986c2b6264c934c61fe"},"schema_version":"1.0","source":{"id":"1601.04175","kind":"arxiv","version":1}},"canonical_sha256":"ff9c834f53915065a0caf751e1b8927b97001a4822f83254c7a9092ea50f8847","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff9c834f53915065a0caf751e1b8927b97001a4822f83254c7a9092ea50f8847","first_computed_at":"2026-05-18T01:22:45.733418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:45.733418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r4OOP1krrakkMMfQD8dMEPosvht+HR4YlKaziC1BCu+gJNnDag+1PfSZdLgBEYteR2nk2JIc9O01/xp2H8oIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:45.733945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3046bc863411bb3639d8e308ae21248beedaeff782d81c9b7c90b51efbfa76fd","sha256:ad0c0d333caa2023912bce499092c384e154134799e7f93e51605b242d033968"],"state_sha256":"cdf94ae7e5a9781cfd27381cbfd87ade58bf14b9fbd53287e948198fd60779a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTOl0zzq8yxiTWTHFpCFglh4IESiG45dW0Rxl9DhvsT1cNvnpKB3oH2bDvYbP9gHOrVN6BENgCYRoo4U0g5+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:43:02.615542Z","bundle_sha256":"6b93b6d81ac21c0b404124f9e0737e29afab0c7b1cc0eef0942575244388759f"}}