{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OOXXJFHRPI2NLDM24D6OA6XIWO","short_pith_number":"pith:OOXXJFHR","schema_version":"1.0","canonical_sha256":"73af7494f17a34d58d9ae0fce07ae8b387a3079c9b8648a6ba33b5b798e8e2de","source":{"kind":"arxiv","id":"1008.3015","version":1},"attestation_state":"computed","paper":{"title":"Graph Coloring and Function Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Reza Rahimi, Amir Daneshgar, Siamak Taati","submitted_at":"2010-08-18T05:21:55Z","abstract_excerpt":"We prove that every partial function with finite domain and range can be effectively simulated through sequential colorings of graphs. Namely, we show that given a finite set $S=\\{0,1,\\ldots,m-1\\}$ and a number $n \\geq \\max\\{m,3\\}$, any partial function $\\varphi:S^{^p} \\to S^{^q}$ (i.e. it may not be defined on some elements of its domain $S^{^p}$) can be effectively (i.e. in polynomial time) transformed to a simple graph $\\matr{G}_{_{\\varphi,n}}$ along with three sets of specified vertices $$X = \\{x_{_{0}},x_{_{1}},\\ldots,x_{_{p-1}}\\}, \\ \\ Y = \\{y_{_{0}},y_{_{1}},\\ldots,y_{_{q-1}}\\}, \\ \\ 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":"1008.3015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-18T05:21:55Z","cross_cats_sorted":[],"title_canon_sha256":"2301cab4b1ca03dde4a9c124a914a4e47a48e41e49f0cafc0452e4c7d566bff8","abstract_canon_sha256":"d814467d619b37be32866df95d09764ceefebab2be262b852483dba16e1d5199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:02.457464Z","signature_b64":"wYST43ffCUE/pHbZKehcTUxPQlfu2AYI8jWe1mrFDIapCRNvzBC65Wv5UInlEJtgE8Nme5YWplgXCtJrGLBzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73af7494f17a34d58d9ae0fce07ae8b387a3079c9b8648a6ba33b5b798e8e2de","last_reissued_at":"2026-05-18T04:42:02.457094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:02.457094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Coloring and Function Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Reza Rahimi, Amir Daneshgar, Siamak Taati","submitted_at":"2010-08-18T05:21:55Z","abstract_excerpt":"We prove that every partial function with finite domain and range can be effectively simulated through sequential colorings of graphs. Namely, we show that given a finite set $S=\\{0,1,\\ldots,m-1\\}$ and a number $n \\geq \\max\\{m,3\\}$, any partial function $\\varphi:S^{^p} \\to S^{^q}$ (i.e. it may not be defined on some elements of its domain $S^{^p}$) can be effectively (i.e. in polynomial time) transformed to a simple graph $\\matr{G}_{_{\\varphi,n}}$ along with three sets of specified vertices $$X = \\{x_{_{0}},x_{_{1}},\\ldots,x_{_{p-1}}\\}, \\ \\ Y = \\{y_{_{0}},y_{_{1}},\\ldots,y_{_{q-1}}\\}, \\ \\ R = "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3015","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":"1008.3015","created_at":"2026-05-18T04:42:02.457151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3015v1","created_at":"2026-05-18T04:42:02.457151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3015","created_at":"2026-05-18T04:42:02.457151+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOXXJFHRPI2N","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOXXJFHRPI2NLDM2","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOXXJFHR","created_at":"2026-05-18T12:26:12.377268+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/OOXXJFHRPI2NLDM24D6OA6XIWO","json":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO.json","graph_json":"https://pith.science/api/pith-number/OOXXJFHRPI2NLDM24D6OA6XIWO/graph.json","events_json":"https://pith.science/api/pith-number/OOXXJFHRPI2NLDM24D6OA6XIWO/events.json","paper":"https://pith.science/paper/OOXXJFHR"},"agent_actions":{"view_html":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO","download_json":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO.json","view_paper":"https://pith.science/paper/OOXXJFHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3015&json=true","fetch_graph":"https://pith.science/api/pith-number/OOXXJFHRPI2NLDM24D6OA6XIWO/graph.json","fetch_events":"https://pith.science/api/pith-number/OOXXJFHRPI2NLDM24D6OA6XIWO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/action/storage_attestation","attest_author":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/action/author_attestation","sign_citation":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/action/citation_signature","submit_replication":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/action/replication_record"}},"created_at":"2026-05-18T04:42:02.457151+00:00","updated_at":"2026-05-18T04:42:02.457151+00:00"}