{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OOXXJFHRPI2NLDM24D6OA6XIWO","short_pith_number":"pith:OOXXJFHR","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"},"canonical_sha256":"73af7494f17a34d58d9ae0fce07ae8b387a3079c9b8648a6ba33b5b798e8e2de","source":{"kind":"arxiv","id":"1008.3015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3015","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3015v1","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3015","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"OOXXJFHRPI2N","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OOXXJFHRPI2NLDM2","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OOXXJFHR","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OOXXJFHRPI2NLDM24D6OA6XIWO","target":"record","payload":{"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"},"canonical_sha256":"73af7494f17a34d58d9ae0fce07ae8b387a3079c9b8648a6ba33b5b798e8e2de","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"},"source_kind":"arxiv","source_id":"1008.3015","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hy4nyU03m+FIdlCHUU7VgzatLWR+IQXwgRATTaRHnMTe+gPjZgGwvb6HhhYPC2QT8id0lh4GLuMqxYjU9nVHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:50:01.546835Z"},"content_sha256":"6c837eeb161794dfcb4ac96f2cb74c9914f534c3451c09e366ac8257ff48bad8","schema_version":"1.0","event_id":"sha256:6c837eeb161794dfcb4ac96f2cb74c9914f534c3451c09e366ac8257ff48bad8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OOXXJFHRPI2NLDM24D6OA6XIWO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKh6o2tJn4MbLGmTTRi/ir69wj+mkA+KK+qVoz7c2U5cngXTyh8XkgbQhCGT6aM0zWDRlLvvDfFwwmC09X+EBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:50:01.547182Z"},"content_sha256":"94f11d07ade99333f621974dfb50ea46b65a51f3c57eda66b5df4023b8285136","schema_version":"1.0","event_id":"sha256:94f11d07ade99333f621974dfb50ea46b65a51f3c57eda66b5df4023b8285136"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/bundle.json","state_url":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:50:01Z","links":{"resolver":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO","bundle":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/bundle.json","state":"https://pith.science/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOXXJFHRPI2NLDM24D6OA6XIWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OOXXJFHRPI2NLDM24D6OA6XIWO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d814467d619b37be32866df95d09764ceefebab2be262b852483dba16e1d5199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-18T05:21:55Z","title_canon_sha256":"2301cab4b1ca03dde4a9c124a914a4e47a48e41e49f0cafc0452e4c7d566bff8"},"schema_version":"1.0","source":{"id":"1008.3015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3015","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3015v1","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3015","created_at":"2026-05-18T04:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"OOXXJFHRPI2N","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OOXXJFHRPI2NLDM2","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OOXXJFHR","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:94f11d07ade99333f621974dfb50ea46b65a51f3c57eda66b5df4023b8285136","target":"graph","created_at":"2026-05-18T04:42:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 = ","authors_text":"Ali Reza Rahimi, Amir Daneshgar, Siamak Taati","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-18T05:21:55Z","title":"Graph Coloring and Function Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3015","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6c837eeb161794dfcb4ac96f2cb74c9914f534c3451c09e366ac8257ff48bad8","target":"record","created_at":"2026-05-18T04:42:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d814467d619b37be32866df95d09764ceefebab2be262b852483dba16e1d5199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-18T05:21:55Z","title_canon_sha256":"2301cab4b1ca03dde4a9c124a914a4e47a48e41e49f0cafc0452e4c7d566bff8"},"schema_version":"1.0","source":{"id":"1008.3015","kind":"arxiv","version":1}},"canonical_sha256":"73af7494f17a34d58d9ae0fce07ae8b387a3079c9b8648a6ba33b5b798e8e2de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73af7494f17a34d58d9ae0fce07ae8b387a3079c9b8648a6ba33b5b798e8e2de","first_computed_at":"2026-05-18T04:42:02.457094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:02.457094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wYST43ffCUE/pHbZKehcTUxPQlfu2AYI8jWe1mrFDIapCRNvzBC65Wv5UInlEJtgE8Nme5YWplgXCtJrGLBzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:02.457464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c837eeb161794dfcb4ac96f2cb74c9914f534c3451c09e366ac8257ff48bad8","sha256:94f11d07ade99333f621974dfb50ea46b65a51f3c57eda66b5df4023b8285136"],"state_sha256":"d4141fe40591d6b190313c4074229bf684487fd6dafb7e885832c45b1ea13f1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3pK5wW1+kGUXN25DGpCExzlVH4e/YZ3so/FKY5vHEuz8J5Ffyv73nkAi1r/1Z+VquZX63e5ekZ0lKv6P7Nr4Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:50:01.549147Z","bundle_sha256":"29fc79ee6a201c3e0e3c34cf2e56097dafd671ef156df703d79691736bf69197"}}