{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DLI2MBMKRHPTHG6VR525UV7APK","short_pith_number":"pith:DLI2MBMK","schema_version":"1.0","canonical_sha256":"1ad1a6058a89df339bd58f75da57e07a9cbb582e6b6e72b62082dee205d12a1c","source":{"kind":"arxiv","id":"2311.13544","version":3},"attestation_state":"computed","paper":{"title":"Piecewise Polynomial Regression of Tame Functions via Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Gilles Bareilles, Jakub Marecek, Jiri Nemecek, Johannes Aspman","submitted_at":"2023-11-22T17:37:42Z","abstract_excerpt":"Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer programs, or wave functions of small molecules. We consider approximating tame functions with piecewise polynomial functions. We bound the quality of approximation of a tame function by a piecewise polynomial function with a given number of segments on any full-dimensional cube. We also present the first mixed-integer programming formulation of piecewise polynomial"},"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":"2311.13544","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-11-22T17:37:42Z","cross_cats_sorted":["cs.AI","cs.LG","math.ST","stat.TH"],"title_canon_sha256":"2924951e2be84046f07a620d419d0e68703e78fe715966ace6cdf80d5501db05","abstract_canon_sha256":"878df836b2c37d50bd94c77bb573177cb8f3b3662320cb328ef39738ac587def"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:00.359499Z","signature_b64":"7KXYoZYyhmn7gRNvsvcirUoPHQHgj7wY8jp1bLJ2o1Px9/1F6a98CeNDlgJ6o52t06as18xbiBZL8LfAHmjKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ad1a6058a89df339bd58f75da57e07a9cbb582e6b6e72b62082dee205d12a1c","last_reissued_at":"2026-07-05T08:27:00.358989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:00.358989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Piecewise Polynomial Regression of Tame Functions via Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.ST","stat.TH"],"primary_cat":"math.OC","authors_text":"Gilles Bareilles, Jakub Marecek, Jiri Nemecek, Johannes Aspman","submitted_at":"2023-11-22T17:37:42Z","abstract_excerpt":"Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer programs, or wave functions of small molecules. We consider approximating tame functions with piecewise polynomial functions. We bound the quality of approximation of a tame function by a piecewise polynomial function with a given number of segments on any full-dimensional cube. We also present the first mixed-integer programming formulation of piecewise polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.13544","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/2311.13544/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":"2311.13544","created_at":"2026-07-05T08:27:00.359064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.13544v3","created_at":"2026-07-05T08:27:00.359064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.13544","created_at":"2026-07-05T08:27:00.359064+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLI2MBMKRHPT","created_at":"2026-07-05T08:27:00.359064+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLI2MBMKRHPTHG6V","created_at":"2026-07-05T08:27:00.359064+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLI2MBMK","created_at":"2026-07-05T08:27:00.359064+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/DLI2MBMKRHPTHG6VR525UV7APK","json":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK.json","graph_json":"https://pith.science/api/pith-number/DLI2MBMKRHPTHG6VR525UV7APK/graph.json","events_json":"https://pith.science/api/pith-number/DLI2MBMKRHPTHG6VR525UV7APK/events.json","paper":"https://pith.science/paper/DLI2MBMK"},"agent_actions":{"view_html":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK","download_json":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK.json","view_paper":"https://pith.science/paper/DLI2MBMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.13544&json=true","fetch_graph":"https://pith.science/api/pith-number/DLI2MBMKRHPTHG6VR525UV7APK/graph.json","fetch_events":"https://pith.science/api/pith-number/DLI2MBMKRHPTHG6VR525UV7APK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK/action/storage_attestation","attest_author":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK/action/author_attestation","sign_citation":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK/action/citation_signature","submit_replication":"https://pith.science/pith/DLI2MBMKRHPTHG6VR525UV7APK/action/replication_record"}},"created_at":"2026-07-05T08:27:00.359064+00:00","updated_at":"2026-07-05T08:27:00.359064+00:00"}