{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UOM7BQ4AW3FCR7JCB2SVLRZF4R","short_pith_number":"pith:UOM7BQ4A","schema_version":"1.0","canonical_sha256":"a399f0c380b6ca28fd220ea555c725e45c40837200c576f8deb655f52691974f","source":{"kind":"arxiv","id":"2412.20141","version":1},"attestation_state":"computed","paper":{"title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Sun, Li-Zhi Liao, Xun Qian","submitted_at":"2024-12-28T13:05:26Z","abstract_excerpt":"Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the feasible region that results in wrong search directions and extra computational cost. A matrix-free interior point augmented Lagrangian continuous trajectory is therefore proposed and studied for linearly constrained convex programming. A closely related ordinary differential equation (ODE) system is formulated. In this ODE system, the variable projection matrix i"},"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":"2412.20141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-28T13:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"6b19610e76a90489ae3ba33485250cb709ca293cfa658e3161a51c9eb27d6255","abstract_canon_sha256":"7c2a9a0e182e79d2e5e0101dce003739ab727c07d38d372aa7411d8804f7b449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:55.009364Z","signature_b64":"KHIhgd4cgNljo1i3NzC0adY7Wi282NVhzLv4GB+Aa6COyaTFgLuDY36iLRl929Z2QhpDDislv4fLpp8XxZTrBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a399f0c380b6ca28fd220ea555c725e45c40837200c576f8deb655f52691974f","last_reissued_at":"2026-07-05T09:54:55.008882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:55.008882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A matrix-free interior point continuous trajectory for linearly constrained convex programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Sun, Li-Zhi Liao, Xun Qian","submitted_at":"2024-12-28T13:05:26Z","abstract_excerpt":"Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the feasible region that results in wrong search directions and extra computational cost. A matrix-free interior point augmented Lagrangian continuous trajectory is therefore proposed and studied for linearly constrained convex programming. A closely related ordinary differential equation (ODE) system is formulated. In this ODE system, the variable projection matrix i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20141","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/2412.20141/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":"2412.20141","created_at":"2026-07-05T09:54:55.008938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20141v1","created_at":"2026-07-05T09:54:55.008938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20141","created_at":"2026-07-05T09:54:55.008938+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOM7BQ4AW3FC","created_at":"2026-07-05T09:54:55.008938+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOM7BQ4AW3FCR7JC","created_at":"2026-07-05T09:54:55.008938+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOM7BQ4A","created_at":"2026-07-05T09:54:55.008938+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/UOM7BQ4AW3FCR7JCB2SVLRZF4R","json":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R.json","graph_json":"https://pith.science/api/pith-number/UOM7BQ4AW3FCR7JCB2SVLRZF4R/graph.json","events_json":"https://pith.science/api/pith-number/UOM7BQ4AW3FCR7JCB2SVLRZF4R/events.json","paper":"https://pith.science/paper/UOM7BQ4A"},"agent_actions":{"view_html":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R","download_json":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R.json","view_paper":"https://pith.science/paper/UOM7BQ4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20141&json=true","fetch_graph":"https://pith.science/api/pith-number/UOM7BQ4AW3FCR7JCB2SVLRZF4R/graph.json","fetch_events":"https://pith.science/api/pith-number/UOM7BQ4AW3FCR7JCB2SVLRZF4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R/action/storage_attestation","attest_author":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R/action/author_attestation","sign_citation":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R/action/citation_signature","submit_replication":"https://pith.science/pith/UOM7BQ4AW3FCR7JCB2SVLRZF4R/action/replication_record"}},"created_at":"2026-07-05T09:54:55.008938+00:00","updated_at":"2026-07-05T09:54:55.008938+00:00"}