{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DLN7KO7TSXYHY3EPTJGWJ5EX77","short_pith_number":"pith:DLN7KO7T","schema_version":"1.0","canonical_sha256":"1adbf53bf395f07c6c8f9a4d64f497ffe75ccefb8f0e22ce4f45e92a05e25718","source":{"kind":"arxiv","id":"2601.18863","version":3},"attestation_state":"computed","paper":{"title":"Tame Complexity of Effective Field Theories in the Quantum Gravity Landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.LO","math.MP","quant-ph"],"primary_cat":"hep-th","authors_text":"David Prieto, Mick van Vliet, Thomas W. Grimm","submitted_at":"2026-01-26T19:00:00Z","abstract_excerpt":"Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that the defining data of such theories, as well as the landscape of effective field theories that are valid at least up to a fixed cutoff, admit descriptions with a uniform bound on complexity. To make this precise, we use tame geometry and work in sharply o-minimal structures, in which tame sets and functions come with two integer parameters that quantify their "},"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":"2601.18863","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2026-01-26T19:00:00Z","cross_cats_sorted":["math-ph","math.LO","math.MP","quant-ph"],"title_canon_sha256":"0421140f7fcf4483c4c1d932af3687011f9e7866cc686342af0362b51db7f119","abstract_canon_sha256":"6911c190c9d4c56f6c8b10880b0032e4774d8efa62f0ed1d276e9116c18716f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:17:49.618849Z","signature_b64":"iawJ3b623l0JCu2xOC7dqlZ6mWoVjpqFUDCW33L6N1YmkL59zAnsc501bCQyWaEnKNT4tS9JuAfFbzbKzYUYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1adbf53bf395f07c6c8f9a4d64f497ffe75ccefb8f0e22ce4f45e92a05e25718","last_reissued_at":"2026-06-25T01:17:49.618447Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:17:49.618447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tame Complexity of Effective Field Theories in the Quantum Gravity Landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.LO","math.MP","quant-ph"],"primary_cat":"hep-th","authors_text":"David Prieto, Mick van Vliet, Thomas W. Grimm","submitted_at":"2026-01-26T19:00:00Z","abstract_excerpt":"Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that the defining data of such theories, as well as the landscape of effective field theories that are valid at least up to a fixed cutoff, admit descriptions with a uniform bound on complexity. To make this precise, we use tame geometry and work in sharply o-minimal structures, in which tame sets and functions come with two integer parameters that quantify their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.18863","kind":"arxiv","version":3},"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/2601.18863/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":"2601.18863","created_at":"2026-06-25T01:17:49.618502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.18863v3","created_at":"2026-06-25T01:17:49.618502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.18863","created_at":"2026-06-25T01:17:49.618502+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLN7KO7TSXYH","created_at":"2026-06-25T01:17:49.618502+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLN7KO7TSXYHY3EP","created_at":"2026-06-25T01:17:49.618502+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLN7KO7T","created_at":"2026-06-25T01:17:49.618502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.23126","citing_title":"Approximating parametric suprema for constructible and power-constructible functions","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77","json":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77.json","graph_json":"https://pith.science/api/pith-number/DLN7KO7TSXYHY3EPTJGWJ5EX77/graph.json","events_json":"https://pith.science/api/pith-number/DLN7KO7TSXYHY3EPTJGWJ5EX77/events.json","paper":"https://pith.science/paper/DLN7KO7T"},"agent_actions":{"view_html":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77","download_json":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77.json","view_paper":"https://pith.science/paper/DLN7KO7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.18863&json=true","fetch_graph":"https://pith.science/api/pith-number/DLN7KO7TSXYHY3EPTJGWJ5EX77/graph.json","fetch_events":"https://pith.science/api/pith-number/DLN7KO7TSXYHY3EPTJGWJ5EX77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77/action/storage_attestation","attest_author":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77/action/author_attestation","sign_citation":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77/action/citation_signature","submit_replication":"https://pith.science/pith/DLN7KO7TSXYHY3EPTJGWJ5EX77/action/replication_record"}},"created_at":"2026-06-25T01:17:49.618502+00:00","updated_at":"2026-06-25T01:17:49.618502+00:00"}