{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q2HEFKN436QR3EHN7LESL74TA4","short_pith_number":"pith:Q2HEFKN4","schema_version":"1.0","canonical_sha256":"868e42a9bcdfa11d90edfac925ff93073d66b0ed54cbb66779da0b0feb180b2e","source":{"kind":"arxiv","id":"2501.10884","version":1},"attestation_state":"computed","paper":{"title":"Fixed Point Computation: Beating Brute Force with Smoothed Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.GT","authors_text":"Constantinos Daskalakis, Idan Attias, Manolis Zampetakis, Rui Yao, Yuval Dagan","submitted_at":"2025-01-18T21:32:26Z","abstract_excerpt":"We propose a new algorithm that finds an $\\varepsilon$-approximate fixed point of a smooth function from the $n$-dimensional $\\ell_2$ unit ball to itself. We use the general framework of finding approximate solutions to a variational inequality, a problem that subsumes fixed point computation and the computation of a Nash Equilibrium. The algorithm's runtime is bounded by $e^{O(n)}/\\varepsilon$, under the smoothed-analysis framework. This is the first known algorithm in such a generality whose runtime is faster than $(1/\\varepsilon)^{O(n)}$, which is a time that suffices for an exhaustive sear"},"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":"2501.10884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-01-18T21:32:26Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"e08c6c50c683f6697297170da4280c934b6458ca805456d6da0eac12372cd150","abstract_canon_sha256":"d426242977633897c46457c5bc538a9db7d9f7a7d60b1091732b9ba29b5e1b88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:00.226816Z","signature_b64":"3dPyjjG70AcwmHOAJZCyWcX0SkOoCsliyHh0pThfZyv8geLOPGFPZVynAqKDBN/kBwxOfwz4omGLcPE3a78vBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"868e42a9bcdfa11d90edfac925ff93073d66b0ed54cbb66779da0b0feb180b2e","last_reissued_at":"2026-07-05T10:03:00.226412Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:00.226412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed Point Computation: Beating Brute Force with Smoothed Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.GT","authors_text":"Constantinos Daskalakis, Idan Attias, Manolis Zampetakis, Rui Yao, Yuval Dagan","submitted_at":"2025-01-18T21:32:26Z","abstract_excerpt":"We propose a new algorithm that finds an $\\varepsilon$-approximate fixed point of a smooth function from the $n$-dimensional $\\ell_2$ unit ball to itself. We use the general framework of finding approximate solutions to a variational inequality, a problem that subsumes fixed point computation and the computation of a Nash Equilibrium. The algorithm's runtime is bounded by $e^{O(n)}/\\varepsilon$, under the smoothed-analysis framework. This is the first known algorithm in such a generality whose runtime is faster than $(1/\\varepsilon)^{O(n)}$, which is a time that suffices for an exhaustive sear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10884","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/2501.10884/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":"2501.10884","created_at":"2026-07-05T10:03:00.226467+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.10884v1","created_at":"2026-07-05T10:03:00.226467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10884","created_at":"2026-07-05T10:03:00.226467+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2HEFKN436QR","created_at":"2026-07-05T10:03:00.226467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2HEFKN436QR3EHN","created_at":"2026-07-05T10:03:00.226467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2HEFKN4","created_at":"2026-07-05T10:03:00.226467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.17698","citing_title":"Pushing the Complexity Boundaries of Fixed-Point Equations: Adaptation to Contraction and Controlled Expansion","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4","json":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4.json","graph_json":"https://pith.science/api/pith-number/Q2HEFKN436QR3EHN7LESL74TA4/graph.json","events_json":"https://pith.science/api/pith-number/Q2HEFKN436QR3EHN7LESL74TA4/events.json","paper":"https://pith.science/paper/Q2HEFKN4"},"agent_actions":{"view_html":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4","download_json":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4.json","view_paper":"https://pith.science/paper/Q2HEFKN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.10884&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2HEFKN436QR3EHN7LESL74TA4/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2HEFKN436QR3EHN7LESL74TA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4/action/storage_attestation","attest_author":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4/action/author_attestation","sign_citation":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4/action/citation_signature","submit_replication":"https://pith.science/pith/Q2HEFKN436QR3EHN7LESL74TA4/action/replication_record"}},"created_at":"2026-07-05T10:03:00.226467+00:00","updated_at":"2026-07-05T10:03:00.226467+00:00"}