{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VT7PWRR2UYLGAHSQZ35UQW7G2B","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":"76c9a89cf7c54282fec083e2d86b8e86b7b2b2f9f40a2a9f6e7e64af3c121f1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-08T12:00:36Z","title_canon_sha256":"585685961f10699c995723d63bbea4edd4d7c33478ce6271bd138a7d81ab3a21"},"schema_version":"1.0","source":{"id":"1707.02428","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02428","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02428v1","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02428","created_at":"2026-05-18T00:40:39Z"},{"alias_kind":"pith_short_12","alias_value":"VT7PWRR2UYLG","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VT7PWRR2UYLGAHSQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VT7PWRR2","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:46da735e362d1948b0036c6573da77f393e593029bcc9d7456219e5b1ea1f3df","target":"graph","created_at":"2026-05-18T00:40:39Z","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 introduce and study the combinatorial optimization problem with interaction costs (COPIC). COPIC is the problem of finding two combinatorial structures, one from each of two given families, such that the sum of their independent linear costs and the interaction costs between elements of the two selected structures is minimized. COPIC generalizes the quadratic assignment problem and many other well studied combinatorial optimization problems, and hence covers many real world applications. We show how various topics from different areas in the literature can be formulated as special cases of ","authors_text":"Abraham P. Punnen, Ante \\'Custi\\'c, Stefan Lendl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-08T12:00:36Z","title":"Combinatorial Optimization Problems with Interaction Costs: Complexity and Solvable Cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02428","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:4dbfeafb1fad248597510a683b9c0b96eebe9b46d2e9c3496f4e15ecb6964288","target":"record","created_at":"2026-05-18T00:40:39Z","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":"76c9a89cf7c54282fec083e2d86b8e86b7b2b2f9f40a2a9f6e7e64af3c121f1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-08T12:00:36Z","title_canon_sha256":"585685961f10699c995723d63bbea4edd4d7c33478ce6271bd138a7d81ab3a21"},"schema_version":"1.0","source":{"id":"1707.02428","kind":"arxiv","version":1}},"canonical_sha256":"acfefb463aa616601e50cefb485be6d04ed9ff5054d2885fbdf4cdeb7d613822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acfefb463aa616601e50cefb485be6d04ed9ff5054d2885fbdf4cdeb7d613822","first_computed_at":"2026-05-18T00:40:39.183177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:39.183177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xrXksLdjD5B5jH5OCHldETFARNT+SAk3NuudmS16dbph04n/RCpEtiGdEoLlCMMmHiSReq6w9Inbuyb2x2KWCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:39.184249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02428","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dbfeafb1fad248597510a683b9c0b96eebe9b46d2e9c3496f4e15ecb6964288","sha256:46da735e362d1948b0036c6573da77f393e593029bcc9d7456219e5b1ea1f3df"],"state_sha256":"18d257070e27395459b62f9b4ca32812ad26af3c2e4a736fb3ee624c308ac7dc"}