{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:76OIGT2TSFIGLIGK65I6DOESPO","short_pith_number":"pith:76OIGT2T","schema_version":"1.0","canonical_sha256":"ff9c834f53915065a0caf751e1b8927b97001a4822f83254c7a9092ea50f8847","source":{"kind":"arxiv","id":"1601.04175","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04175","created_at":"2026-05-18T01:22:45.733506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04175v1","created_at":"2026-05-18T01:22:45.733506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04175","created_at":"2026-05-18T01:22:45.733506+00:00"},{"alias_kind":"pith_short_12","alias_value":"76OIGT2TSFIG","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"76OIGT2TSFIGLIGK","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"76OIGT2T","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO","json":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO.json","graph_json":"https://pith.science/api/pith-number/76OIGT2TSFIGLIGK65I6DOESPO/graph.json","events_json":"https://pith.science/api/pith-number/76OIGT2TSFIGLIGK65I6DOESPO/events.json","paper":"https://pith.science/paper/76OIGT2T"},"agent_actions":{"view_html":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO","download_json":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO.json","view_paper":"https://pith.science/paper/76OIGT2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04175&json=true","fetch_graph":"https://pith.science/api/pith-number/76OIGT2TSFIGLIGK65I6DOESPO/graph.json","fetch_events":"https://pith.science/api/pith-number/76OIGT2TSFIGLIGK65I6DOESPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/action/storage_attestation","attest_author":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/action/author_attestation","sign_citation":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/action/citation_signature","submit_replication":"https://pith.science/pith/76OIGT2TSFIGLIGK65I6DOESPO/action/replication_record"}},"created_at":"2026-05-18T01:22:45.733506+00:00","updated_at":"2026-05-18T01:22:45.733506+00:00"}