{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F7A3TONSJPHWT7OHVEFTFVTRF2","short_pith_number":"pith:F7A3TONS","canonical_record":{"source":{"id":"1507.01776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T12:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"d347acd6b52d2cea32c15e9ea7f12b2f110356e4eefa58bd580311f498800563","abstract_canon_sha256":"a8047464ca5577920b5adea9bd481c6b16721112093c45adedbbea7c0851d8de"},"schema_version":"1.0"},"canonical_sha256":"2fc1b9b9b24bcf69fdc7a90b32d6712e8ff46107153c0ca3dc1fbcb982fa5c79","source":{"kind":"arxiv","id":"1507.01776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01776","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01776v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01776","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"F7A3TONSJPHW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F7A3TONSJPHWT7OH","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F7A3TONS","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F7A3TONSJPHWT7OHVEFTFVTRF2","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T12:23:23Z","cross_cats_sorted":[],"title_canon_sha256":"d347acd6b52d2cea32c15e9ea7f12b2f110356e4eefa58bd580311f498800563","abstract_canon_sha256":"a8047464ca5577920b5adea9bd481c6b16721112093c45adedbbea7c0851d8de"},"schema_version":"1.0"},"canonical_sha256":"2fc1b9b9b24bcf69fdc7a90b32d6712e8ff46107153c0ca3dc1fbcb982fa5c79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.410641Z","signature_b64":"lZTxvATBapIwtOXlV7uWDPOrH6BxU/1V4qOCbfFpHU+twjabKBiVaT6wis0891k0uYf8rJ084bnEJXLV5vzSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fc1b9b9b24bcf69fdc7a90b32d6712e8ff46107153c0ca3dc1fbcb982fa5c79","last_reissued_at":"2026-05-18T01:37:12.409880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.409880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01776","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mqRrI4yZUFkgULEXEgWV0JOm9dQaQBx9wcy8kXUCKq7ut681C416T+robPmV8h9kyk99yEUP1ByRpbvZrblAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:44:58.521764Z"},"content_sha256":"9c710a937fe7dfd55993c412cfd427f786597e91bb3c2797821ad7a0b262e55c","schema_version":"1.0","event_id":"sha256:9c710a937fe7dfd55993c412cfd427f786597e91bb3c2797821ad7a0b262e55c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F7A3TONSJPHWT7OHVEFTFVTRF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reduction from Valued CSP to Min Cost Homomorphism Problem for Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrei Krokhin, Robert Powell","submitted_at":"2015-07-07T12:23:23Z","abstract_excerpt":"In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational numbers or infinity, and is chosen from a fixed finite set of functions called a constraint language. The case when all functions take only values 0 and infinity is known as the constraint satisfaction problem (CSP). It is known that any CSP with fixed constraint language is polynomial-time equivalent to one where the constraint language contains a single b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01776","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-18T01:37:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2a/GCsFRd2XF4FEc5LcPmSesoGzj8uoT8nYtRntDwhUcBILxBxvV1RyByMda6HVaZBP/hW+yMsaoxRBt6U7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:44:58.522113Z"},"content_sha256":"09f2f18f98299c879e48b2955da4ee183d84b186a50b32549d701c79382fb99a","schema_version":"1.0","event_id":"sha256:09f2f18f98299c879e48b2955da4ee183d84b186a50b32549d701c79382fb99a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7A3TONSJPHWT7OHVEFTFVTRF2/bundle.json","state_url":"https://pith.science/pith/F7A3TONSJPHWT7OHVEFTFVTRF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7A3TONSJPHWT7OHVEFTFVTRF2/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-22T22:44:58Z","links":{"resolver":"https://pith.science/pith/F7A3TONSJPHWT7OHVEFTFVTRF2","bundle":"https://pith.science/pith/F7A3TONSJPHWT7OHVEFTFVTRF2/bundle.json","state":"https://pith.science/pith/F7A3TONSJPHWT7OHVEFTFVTRF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7A3TONSJPHWT7OHVEFTFVTRF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F7A3TONSJPHWT7OHVEFTFVTRF2","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":"a8047464ca5577920b5adea9bd481c6b16721112093c45adedbbea7c0851d8de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T12:23:23Z","title_canon_sha256":"d347acd6b52d2cea32c15e9ea7f12b2f110356e4eefa58bd580311f498800563"},"schema_version":"1.0","source":{"id":"1507.01776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01776","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01776v1","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01776","created_at":"2026-05-18T01:37:12Z"},{"alias_kind":"pith_short_12","alias_value":"F7A3TONSJPHW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F7A3TONSJPHWT7OH","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F7A3TONS","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:09f2f18f98299c879e48b2955da4ee183d84b186a50b32549d701c79382fb99a","target":"graph","created_at":"2026-05-18T01:37:12Z","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":"In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational numbers or infinity, and is chosen from a fixed finite set of functions called a constraint language. The case when all functions take only values 0 and infinity is known as the constraint satisfaction problem (CSP). It is known that any CSP with fixed constraint language is polynomial-time equivalent to one where the constraint language contains a single b","authors_text":"Andrei Krokhin, Robert Powell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T12:23:23Z","title":"A Reduction from Valued CSP to Min Cost Homomorphism Problem for Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01776","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:9c710a937fe7dfd55993c412cfd427f786597e91bb3c2797821ad7a0b262e55c","target":"record","created_at":"2026-05-18T01:37:12Z","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":"a8047464ca5577920b5adea9bd481c6b16721112093c45adedbbea7c0851d8de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-07-07T12:23:23Z","title_canon_sha256":"d347acd6b52d2cea32c15e9ea7f12b2f110356e4eefa58bd580311f498800563"},"schema_version":"1.0","source":{"id":"1507.01776","kind":"arxiv","version":1}},"canonical_sha256":"2fc1b9b9b24bcf69fdc7a90b32d6712e8ff46107153c0ca3dc1fbcb982fa5c79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fc1b9b9b24bcf69fdc7a90b32d6712e8ff46107153c0ca3dc1fbcb982fa5c79","first_computed_at":"2026-05-18T01:37:12.409880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:12.409880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lZTxvATBapIwtOXlV7uWDPOrH6BxU/1V4qOCbfFpHU+twjabKBiVaT6wis0891k0uYf8rJ084bnEJXLV5vzSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:12.410641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c710a937fe7dfd55993c412cfd427f786597e91bb3c2797821ad7a0b262e55c","sha256:09f2f18f98299c879e48b2955da4ee183d84b186a50b32549d701c79382fb99a"],"state_sha256":"086cbf11a5c35efd26fd12d48eec963fd7c832c0aeb9d9bf9c9d20753f40ea7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qg2ibhuS6xkraICQZbJQBH2y7wWLRL3x9WqJ4bv56RLW2jJbb8uNSWAeSkfOxqwl/F9yS1CmO94x5h7z9+2ODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:44:58.524033Z","bundle_sha256":"696520e605b6e3e3806c74ce8de221ad8cb0214b7e9c9acdf9a99746c93ad19f"}}