{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BUZRCHFYRNGUXKF7TB2KTJFXYO","short_pith_number":"pith:BUZRCHFY","schema_version":"1.0","canonical_sha256":"0d33111cb88b4d4ba8bf9874a9a4b7c3af1a31d424ec9e40e258b13faeac6a5d","source":{"kind":"arxiv","id":"2411.10107","version":2},"attestation_state":"computed","paper":{"title":"Monotone Contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eleni Batziou, John Fearnley, Rahul Savani, Ruta Mehta, Spencer Gordon","submitted_at":"2024-11-15T11:07:05Z","abstract_excerpt":"We study functions $f : [0, 1]^d \\rightarrow [0, 1]^d$ that are both monotone and contracting, and we consider the problem of finding an $\\varepsilon$-approximate fixed point of $f$. We show that the problem lies in the complexity class UEOPL. We give an algorithm that finds an $\\varepsilon$-approximate fixed point of a three-dimensional monotone contraction using $O(\\log (1/\\varepsilon))$ queries to $f$. We also give a decomposition theorem that allows us to use this result to obtain an algorithm that finds an $\\varepsilon$-approximate fixed point of a $d$-dimensional monotone contraction usi"},"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":"2411.10107","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-15T11:07:05Z","cross_cats_sorted":[],"title_canon_sha256":"2a6aa0e24fc14cd79b2bd6606e6ccaf95b2d1a89ed39a12ae3ca43367bd5fc03","abstract_canon_sha256":"976c7d3a7e51ab7e80cf594e0e1f66032794df8d5a791120a2d993731987cc62"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:14.150289Z","signature_b64":"KdFpS08k8mPz6YGbOJyBTqMVOETykSBN9qMyLyYKSf4YyNPGSvpsdKiJCEjGLiLmLrL7qLf32DGsf+fq9byNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d33111cb88b4d4ba8bf9874a9a4b7c3af1a31d424ec9e40e258b13faeac6a5d","last_reissued_at":"2026-07-05T10:40:14.149830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:14.149830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Contractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Eleni Batziou, John Fearnley, Rahul Savani, Ruta Mehta, Spencer Gordon","submitted_at":"2024-11-15T11:07:05Z","abstract_excerpt":"We study functions $f : [0, 1]^d \\rightarrow [0, 1]^d$ that are both monotone and contracting, and we consider the problem of finding an $\\varepsilon$-approximate fixed point of $f$. We show that the problem lies in the complexity class UEOPL. We give an algorithm that finds an $\\varepsilon$-approximate fixed point of a three-dimensional monotone contraction using $O(\\log (1/\\varepsilon))$ queries to $f$. We also give a decomposition theorem that allows us to use this result to obtain an algorithm that finds an $\\varepsilon$-approximate fixed point of a $d$-dimensional monotone contraction usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.10107","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/2411.10107/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":"2411.10107","created_at":"2026-07-05T10:40:14.149889+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.10107v2","created_at":"2026-07-05T10:40:14.149889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.10107","created_at":"2026-07-05T10:40:14.149889+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUZRCHFYRNGU","created_at":"2026-07-05T10:40:14.149889+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUZRCHFYRNGUXKF7","created_at":"2026-07-05T10:40:14.149889+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUZRCHFY","created_at":"2026-07-05T10:40:14.149889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06477","citing_title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","ref_index":1922,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO","json":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO.json","graph_json":"https://pith.science/api/pith-number/BUZRCHFYRNGUXKF7TB2KTJFXYO/graph.json","events_json":"https://pith.science/api/pith-number/BUZRCHFYRNGUXKF7TB2KTJFXYO/events.json","paper":"https://pith.science/paper/BUZRCHFY"},"agent_actions":{"view_html":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO","download_json":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO.json","view_paper":"https://pith.science/paper/BUZRCHFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.10107&json=true","fetch_graph":"https://pith.science/api/pith-number/BUZRCHFYRNGUXKF7TB2KTJFXYO/graph.json","fetch_events":"https://pith.science/api/pith-number/BUZRCHFYRNGUXKF7TB2KTJFXYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO/action/storage_attestation","attest_author":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO/action/author_attestation","sign_citation":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO/action/citation_signature","submit_replication":"https://pith.science/pith/BUZRCHFYRNGUXKF7TB2KTJFXYO/action/replication_record"}},"created_at":"2026-07-05T10:40:14.149889+00:00","updated_at":"2026-07-05T10:40:14.149889+00:00"}