{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CO3SRH7B2OC3UT5XAI7AI45L7R","short_pith_number":"pith:CO3SRH7B","schema_version":"1.0","canonical_sha256":"13b7289fe1d385ba4fb7023e0473abfc4145ab2130147889d02a5bb12137b5ea","source":{"kind":"arxiv","id":"2406.02421","version":2},"attestation_state":"computed","paper":{"title":"Representing Piecewise-Linear Functions by Functions with Minimal Arity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SC"],"primary_cat":"cs.DM","authors_text":"Anton Ponomarchuk, Christoph Koutschan, Josef Schicho","submitted_at":"2024-06-04T15:39:08Z","abstract_excerpt":"Any continuous piecewise-linear function $F\\colon \\mathbb{R}^{n}\\to \\mathbb{R}$ can be represented as a linear combination of $\\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear functions by functions with small arity'', AAECC, 2023], we showed that this upper bound of $n+1$ arguments is tight. In the present paper, we extend this result by establishing a correspondence between the function $F$ and the minimal number of arguments that are needed in any such decomposition. We show that the tessellation of the input space $\\mathbb{R}^"},"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":"2406.02421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2024-06-04T15:39:08Z","cross_cats_sorted":["cs.LG","cs.SC"],"title_canon_sha256":"1538e1a0a7ca4c33ad13875cd8825f54e3edd666dcca4cd834e1fcd20985f00e","abstract_canon_sha256":"c77957319e4ab8705150ff2929e8d7ac4db0b2e427d6d0b98cdeaa714dccfd06"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:12.649132Z","signature_b64":"qi4M/znXpF3g/8mxrZk2QziqHC7KS6YMtIvH+UlM5hq/wVltvkwiSv2aHqA/9I2JWIxHc0DyF3Roa7Q+qpCXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b7289fe1d385ba4fb7023e0473abfc4145ab2130147889d02a5bb12137b5ea","last_reissued_at":"2026-06-19T16:12:12.648724Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:12.648724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representing Piecewise-Linear Functions by Functions with Minimal Arity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SC"],"primary_cat":"cs.DM","authors_text":"Anton Ponomarchuk, Christoph Koutschan, Josef Schicho","submitted_at":"2024-06-04T15:39:08Z","abstract_excerpt":"Any continuous piecewise-linear function $F\\colon \\mathbb{R}^{n}\\to \\mathbb{R}$ can be represented as a linear combination of $\\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear functions by functions with small arity'', AAECC, 2023], we showed that this upper bound of $n+1$ arguments is tight. In the present paper, we extend this result by establishing a correspondence between the function $F$ and the minimal number of arguments that are needed in any such decomposition. We show that the tessellation of the input space $\\mathbb{R}^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02421","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/2406.02421/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":"2406.02421","created_at":"2026-06-19T16:12:12.648785+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02421v2","created_at":"2026-06-19T16:12:12.648785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02421","created_at":"2026-06-19T16:12:12.648785+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO3SRH7B2OC3","created_at":"2026-06-19T16:12:12.648785+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO3SRH7B2OC3UT5X","created_at":"2026-06-19T16:12:12.648785+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO3SRH7B","created_at":"2026-06-19T16:12:12.648785+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/CO3SRH7B2OC3UT5XAI7AI45L7R","json":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R.json","graph_json":"https://pith.science/api/pith-number/CO3SRH7B2OC3UT5XAI7AI45L7R/graph.json","events_json":"https://pith.science/api/pith-number/CO3SRH7B2OC3UT5XAI7AI45L7R/events.json","paper":"https://pith.science/paper/CO3SRH7B"},"agent_actions":{"view_html":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R","download_json":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R.json","view_paper":"https://pith.science/paper/CO3SRH7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02421&json=true","fetch_graph":"https://pith.science/api/pith-number/CO3SRH7B2OC3UT5XAI7AI45L7R/graph.json","fetch_events":"https://pith.science/api/pith-number/CO3SRH7B2OC3UT5XAI7AI45L7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R/action/storage_attestation","attest_author":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R/action/author_attestation","sign_citation":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R/action/citation_signature","submit_replication":"https://pith.science/pith/CO3SRH7B2OC3UT5XAI7AI45L7R/action/replication_record"}},"created_at":"2026-06-19T16:12:12.648785+00:00","updated_at":"2026-06-19T16:12:12.648785+00:00"}