{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QVTKR3VE3STWKTWVCIVQCFN6LQ","short_pith_number":"pith:QVTKR3VE","schema_version":"1.0","canonical_sha256":"8566a8eea4dca7654ed5122b0115be5c191fb305c3c078045ee9ff6d619ac5c3","source":{"kind":"arxiv","id":"2404.03767","version":2},"attestation_state":"computed","paper":{"title":"Mathematical Program Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Forrest Laine","submitted_at":"2024-03-28T13:00:49Z","abstract_excerpt":"Mathematical Program Networks (MPNs) are introduced in this work. An MPN is a collection of interdependent Mathematical Programs (MPs) which are to be solved simultaneously, while respecting the connectivity pattern of the network defining their relationships. The network structure of an MPN impacts which decision variables each constituent mathematical program can influence, either directly or indirectly via solution graph constraints representing optimal decisions for their decedents. Many existing problem formulations can be formulated as MPNs, including Nash Equilibrium problems, multileve"},"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":"2404.03767","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T13:00:49Z","cross_cats_sorted":[],"title_canon_sha256":"5ba452f0f34043157daa84771dd369c85b3b3f5e71da5428642b5904f9651029","abstract_canon_sha256":"dc6a7d9fe4022ee0c322855f72fcbaecdfd6d86087bb5b18f908345d0fb9aa6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:11:03.049231Z","signature_b64":"+wOTi1snU5MYMP38f3VxJN1BKgfMZR9hOScfGL/+bo1CU3bV6ikevqTsq9XcyAZJy3Uq87+U5BPuW/wPLZg+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8566a8eea4dca7654ed5122b0115be5c191fb305c3c078045ee9ff6d619ac5c3","last_reissued_at":"2026-07-05T08:11:03.048854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:11:03.048854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mathematical Program Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Forrest Laine","submitted_at":"2024-03-28T13:00:49Z","abstract_excerpt":"Mathematical Program Networks (MPNs) are introduced in this work. An MPN is a collection of interdependent Mathematical Programs (MPs) which are to be solved simultaneously, while respecting the connectivity pattern of the network defining their relationships. The network structure of an MPN impacts which decision variables each constituent mathematical program can influence, either directly or indirectly via solution graph constraints representing optimal decisions for their decedents. Many existing problem formulations can be formulated as MPNs, including Nash Equilibrium problems, multileve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03767","kind":"arxiv","version":2},"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/2404.03767/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.03767","created_at":"2026-07-05T08:11:03.048911+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.03767v2","created_at":"2026-07-05T08:11:03.048911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03767","created_at":"2026-07-05T08:11:03.048911+00:00"},{"alias_kind":"pith_short_12","alias_value":"QVTKR3VE3STW","created_at":"2026-07-05T08:11:03.048911+00:00"},{"alias_kind":"pith_short_16","alias_value":"QVTKR3VE3STWKTWV","created_at":"2026-07-05T08:11:03.048911+00:00"},{"alias_kind":"pith_short_8","alias_value":"QVTKR3VE","created_at":"2026-07-05T08:11:03.048911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.01568","citing_title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ","json":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ.json","graph_json":"https://pith.science/api/pith-number/QVTKR3VE3STWKTWVCIVQCFN6LQ/graph.json","events_json":"https://pith.science/api/pith-number/QVTKR3VE3STWKTWVCIVQCFN6LQ/events.json","paper":"https://pith.science/paper/QVTKR3VE"},"agent_actions":{"view_html":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ","download_json":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ.json","view_paper":"https://pith.science/paper/QVTKR3VE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.03767&json=true","fetch_graph":"https://pith.science/api/pith-number/QVTKR3VE3STWKTWVCIVQCFN6LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/QVTKR3VE3STWKTWVCIVQCFN6LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ/action/storage_attestation","attest_author":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ/action/author_attestation","sign_citation":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ/action/citation_signature","submit_replication":"https://pith.science/pith/QVTKR3VE3STWKTWVCIVQCFN6LQ/action/replication_record"}},"created_at":"2026-07-05T08:11:03.048911+00:00","updated_at":"2026-07-05T08:11:03.048911+00:00"}