{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y4Z2AZPKFRSQ7DYSSDQTFFLKAU","short_pith_number":"pith:Y4Z2AZPK","schema_version":"1.0","canonical_sha256":"c733a065ea2c650f8f1290e132956a0526b388b5bccbab56b0a1446c967cbc7c","source":{"kind":"arxiv","id":"1803.07107","version":2},"attestation_state":"computed","paper":{"title":"Computational performance of a projection and rescaling algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pena, Negar Soheili","submitted_at":"2018-03-19T18:31:27Z","abstract_excerpt":"This paper documents a computational implementation of a {\\em projection and rescaling algorithm} for finding most interior solutions to the pair of feasibility problems \\[ \\text{find} \\; x\\in L\\cap\\mathbb{R}^n_{+} \\;\\;\\;\\; \\text{ and } \\; \\;\\;\\;\\; \\text{find} \\; \\hat x\\in L^\\perp\\cap\\mathbb{R}^n_{+}, \\] where $L$ denotes a linear subspace in $\\mathbb{R}^n$ and $L^\\perp$ denotes its orthogonal complement. The projection and rescaling algorithm is a recently developed method that combines a {\\em basic procedure} involving only low-cost operations with a periodic {\\em rescaling step.} We give a "},"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":"1803.07107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-19T18:31:27Z","cross_cats_sorted":[],"title_canon_sha256":"5b9bc34ee407b8cb6044fcae6f91a9af0901a9b38723a5d47ea9f8d4f20a6ed0","abstract_canon_sha256":"0fb93087ba0758408e32552cfd39bf0f3009cab79edd74ca409ea8237f285de4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:32.664331Z","signature_b64":"Aux8WIJzud0QhM9DUUZ8jqJ0ZqMJWcg29D9ZY3KmAr9ujQjteXT6mIbCS99KQnzrWVsntE5oONUgLP0UwmAFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c733a065ea2c650f8f1290e132956a0526b388b5bccbab56b0a1446c967cbc7c","last_reissued_at":"2026-05-17T23:44:32.663738Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:32.663738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational performance of a projection and rescaling algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Javier Pena, Negar Soheili","submitted_at":"2018-03-19T18:31:27Z","abstract_excerpt":"This paper documents a computational implementation of a {\\em projection and rescaling algorithm} for finding most interior solutions to the pair of feasibility problems \\[ \\text{find} \\; x\\in L\\cap\\mathbb{R}^n_{+} \\;\\;\\;\\; \\text{ and } \\; \\;\\;\\;\\; \\text{find} \\; \\hat x\\in L^\\perp\\cap\\mathbb{R}^n_{+}, \\] where $L$ denotes a linear subspace in $\\mathbb{R}^n$ and $L^\\perp$ denotes its orthogonal complement. The projection and rescaling algorithm is a recently developed method that combines a {\\em basic procedure} involving only low-cost operations with a periodic {\\em rescaling step.} We give a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.07107","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":""},"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":"1803.07107","created_at":"2026-05-17T23:44:32.663822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.07107v2","created_at":"2026-05-17T23:44:32.663822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.07107","created_at":"2026-05-17T23:44:32.663822+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4Z2AZPKFRSQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4Z2AZPKFRSQ7DYS","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4Z2AZPK","created_at":"2026-05-18T12:33:04.347982+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/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU","json":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU.json","graph_json":"https://pith.science/api/pith-number/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/graph.json","events_json":"https://pith.science/api/pith-number/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/events.json","paper":"https://pith.science/paper/Y4Z2AZPK"},"agent_actions":{"view_html":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU","download_json":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU.json","view_paper":"https://pith.science/paper/Y4Z2AZPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.07107&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/action/storage_attestation","attest_author":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/action/author_attestation","sign_citation":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/action/citation_signature","submit_replication":"https://pith.science/pith/Y4Z2AZPKFRSQ7DYSSDQTFFLKAU/action/replication_record"}},"created_at":"2026-05-17T23:44:32.663822+00:00","updated_at":"2026-05-17T23:44:32.663822+00:00"}