{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y3FKB4KJLIKICMTNYW7X5FBGFG","short_pith_number":"pith:Y3FKB4KJ","schema_version":"1.0","canonical_sha256":"c6caa0f1495a1481326dc5bf7e942629b6dc257b588f27ab4f12db2110dd9fd3","source":{"kind":"arxiv","id":"1711.06772","version":1},"attestation_state":"computed","paper":{"title":"Separable discrete functions: recognition and sufficient conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Ondrej Cepek, Vladimir Gurvich","submitted_at":"2017-11-17T23:28:09Z","abstract_excerpt":"A discrete function of $n$ variables is a mapping $g : X_1 \\times \\ldots \\times X_n \\rightarrow A$, where $X_1, \\ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\\em separable} if there exist $n$ functions $g_i : X_i \\rightarrow A$ for $i = 1, \\ldots, n$, such that for every input $x_1, \\ldots ,x_n$ the function $g(x_1, \\ldots, x_n)$ takes one of the values $g_1(x_1), \\ldots ,g_n(x_n)$. Given a discrete function $g$, it is an interesting problem to ask whether $g$ is separable or not. Although this seems to be a very basic problem concerning discrete functions, the compl"},"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":"1711.06772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-17T23:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"9aa36277ab1f4fd014b61805e2d9304e6b1a075f3e6ad88543ec22d3f42c0028","abstract_canon_sha256":"66a0393f2f2f1da4eeabb9efaff9b5fa8cda89394bfef15319304df78a64ce1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:15.650617Z","signature_b64":"i0xVVk6UYxv/6sxuk+sczj3sv6l6yI+qn9jomP0vckPVl0dX9BMRNOQu2erTMkgluWTG5PP+YRnkJl8QZwcrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6caa0f1495a1481326dc5bf7e942629b6dc257b588f27ab4f12db2110dd9fd3","last_reissued_at":"2026-05-18T00:30:15.649846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:15.649846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separable discrete functions: recognition and sufficient conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Ondrej Cepek, Vladimir Gurvich","submitted_at":"2017-11-17T23:28:09Z","abstract_excerpt":"A discrete function of $n$ variables is a mapping $g : X_1 \\times \\ldots \\times X_n \\rightarrow A$, where $X_1, \\ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\\em separable} if there exist $n$ functions $g_i : X_i \\rightarrow A$ for $i = 1, \\ldots, n$, such that for every input $x_1, \\ldots ,x_n$ the function $g(x_1, \\ldots, x_n)$ takes one of the values $g_1(x_1), \\ldots ,g_n(x_n)$. Given a discrete function $g$, it is an interesting problem to ask whether $g$ is separable or not. Although this seems to be a very basic problem concerning discrete functions, the compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06772","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":""},"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":"1711.06772","created_at":"2026-05-18T00:30:15.649975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06772v1","created_at":"2026-05-18T00:30:15.649975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06772","created_at":"2026-05-18T00:30:15.649975+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3FKB4KJLIKI","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3FKB4KJLIKICMTN","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3FKB4KJ","created_at":"2026-05-18T12:31:56.362134+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/Y3FKB4KJLIKICMTNYW7X5FBGFG","json":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG.json","graph_json":"https://pith.science/api/pith-number/Y3FKB4KJLIKICMTNYW7X5FBGFG/graph.json","events_json":"https://pith.science/api/pith-number/Y3FKB4KJLIKICMTNYW7X5FBGFG/events.json","paper":"https://pith.science/paper/Y3FKB4KJ"},"agent_actions":{"view_html":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG","download_json":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG.json","view_paper":"https://pith.science/paper/Y3FKB4KJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06772&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3FKB4KJLIKICMTNYW7X5FBGFG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3FKB4KJLIKICMTNYW7X5FBGFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG/action/storage_attestation","attest_author":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG/action/author_attestation","sign_citation":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG/action/citation_signature","submit_replication":"https://pith.science/pith/Y3FKB4KJLIKICMTNYW7X5FBGFG/action/replication_record"}},"created_at":"2026-05-18T00:30:15.649975+00:00","updated_at":"2026-05-18T00:30:15.649975+00:00"}