{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QO7OUYHXMCALMII655F2CH7L5C","short_pith_number":"pith:QO7OUYHX","schema_version":"1.0","canonical_sha256":"83beea60f76080b6211eef4ba11febe899458485fbbfc70f80d3760e8ff76f9f","source":{"kind":"arxiv","id":"1210.2260","version":1},"attestation_state":"computed","paper":{"title":"Extensions of the Minimum Cost Homomorphism Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rustem Takhanov","submitted_at":"2012-10-08T12:39:06Z","abstract_excerpt":"Assume $D$ is a finite set and $R$ is a finite set of functions from $D$ to the natural numbers. An instance of the minimum $R$-cost homomorphism problem ($MinHom_R$) is a set of variables $V$ subject to specified constraints together with a positive weight $c_{vr}$ for each combination of $v \\in V$ and $r \\in R$. The aim is to find a function $f:V \\rightarrow D$ such that $f$ satisfies all constraints and $\\sum_{v \\in V} \\sum_{r \\in R} c_{vr}r(f(v))$ is minimized.\n  This problem unifies well-known optimization problems such as the minimum cost homomorphism problem and the maximum solution pro"},"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":"1210.2260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-08T12:39:06Z","cross_cats_sorted":[],"title_canon_sha256":"141d05367781a556cec26c2cc5aa1878f7d6e2088afd2f7ddecf6d88a0bbca0f","abstract_canon_sha256":"c5d65109f96676f23d2164d6ffc0a69e800f40d4fb66439faa62b150ddb34fc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:50.683003Z","signature_b64":"hKLoQ69pBwi8/DFmVhPnu+6gGgbK7cGTkfYRH28S481+eO/BmeIjBafZh1pzYLD5DO5X0Ego0kEmVf2ztD1BBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83beea60f76080b6211eef4ba11febe899458485fbbfc70f80d3760e8ff76f9f","last_reissued_at":"2026-05-18T03:43:50.682298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:50.682298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extensions of the Minimum Cost Homomorphism Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rustem Takhanov","submitted_at":"2012-10-08T12:39:06Z","abstract_excerpt":"Assume $D$ is a finite set and $R$ is a finite set of functions from $D$ to the natural numbers. An instance of the minimum $R$-cost homomorphism problem ($MinHom_R$) is a set of variables $V$ subject to specified constraints together with a positive weight $c_{vr}$ for each combination of $v \\in V$ and $r \\in R$. The aim is to find a function $f:V \\rightarrow D$ such that $f$ satisfies all constraints and $\\sum_{v \\in V} \\sum_{r \\in R} c_{vr}r(f(v))$ is minimized.\n  This problem unifies well-known optimization problems such as the minimum cost homomorphism problem and the maximum solution pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2260","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":"1210.2260","created_at":"2026-05-18T03:43:50.682416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2260v1","created_at":"2026-05-18T03:43:50.682416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2260","created_at":"2026-05-18T03:43:50.682416+00:00"},{"alias_kind":"pith_short_12","alias_value":"QO7OUYHXMCAL","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QO7OUYHXMCALMII6","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QO7OUYHX","created_at":"2026-05-18T12:27:18.751474+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/QO7OUYHXMCALMII655F2CH7L5C","json":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C.json","graph_json":"https://pith.science/api/pith-number/QO7OUYHXMCALMII655F2CH7L5C/graph.json","events_json":"https://pith.science/api/pith-number/QO7OUYHXMCALMII655F2CH7L5C/events.json","paper":"https://pith.science/paper/QO7OUYHX"},"agent_actions":{"view_html":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C","download_json":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C.json","view_paper":"https://pith.science/paper/QO7OUYHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2260&json=true","fetch_graph":"https://pith.science/api/pith-number/QO7OUYHXMCALMII655F2CH7L5C/graph.json","fetch_events":"https://pith.science/api/pith-number/QO7OUYHXMCALMII655F2CH7L5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C/action/storage_attestation","attest_author":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C/action/author_attestation","sign_citation":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C/action/citation_signature","submit_replication":"https://pith.science/pith/QO7OUYHXMCALMII655F2CH7L5C/action/replication_record"}},"created_at":"2026-05-18T03:43:50.682416+00:00","updated_at":"2026-05-18T03:43:50.682416+00:00"}