{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HSBRIG4KCAPUMZ4SZRK6SA6PHX","short_pith_number":"pith:HSBRIG4K","schema_version":"1.0","canonical_sha256":"3c83141b8a101f466792cc55e903cf3dfe31714b8a759edf1c8486914b515264","source":{"kind":"arxiv","id":"1802.00897","version":2},"attestation_state":"computed","paper":{"title":"Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Abraham P. Punnen, Pooja Pandey","submitted_at":"2018-02-03T02:39:36Z","abstract_excerpt":"The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrix Q and a linear cost vector c. Different, but equivalent, representations of the pair (Q, c) for the same QCOP are well known in literature. Research papers often state that without loss of generality we assume Q is symmetric, or upper-triangular or positive semidefinite, etc. These representations however have inherently different properties. Popular general purpose 0-1 QCOP solvers such as GUROBI and CPLEX do not suggest a preferred representation of Q"},"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":"1802.00897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-03T02:39:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"67c9e7a8edc214588db7fd25ca0d7e6f18c88e08e8e573e34f4275f3d3ed0b07","abstract_canon_sha256":"3ff4ac8e91f71e9b667cd273b67dd2eb9dc43b0be767ee5ba0757365e0b032a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:44.197455Z","signature_b64":"xuHk8w7e6eVrtI36nqGnfi4SdAHp5X9lvaZ1Df2Ukblz5O7PzrC24SzrnQhs2MCSW7aAGy7z0k5jb5JDEo3zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c83141b8a101f466792cc55e903cf3dfe31714b8a759edf1c8486914b515264","last_reissued_at":"2026-05-18T00:22:44.197025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:44.197025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Abraham P. Punnen, Pooja Pandey","submitted_at":"2018-02-03T02:39:36Z","abstract_excerpt":"The objective function of a quadratic combinatorial optimization problem (QCOP) can be represented by two data points, a quadratic cost matrix Q and a linear cost vector c. Different, but equivalent, representations of the pair (Q, c) for the same QCOP are well known in literature. Research papers often state that without loss of generality we assume Q is symmetric, or upper-triangular or positive semidefinite, etc. These representations however have inherently different properties. Popular general purpose 0-1 QCOP solvers such as GUROBI and CPLEX do not suggest a preferred representation of Q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00897","kind":"arxiv","version":2},"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":"1802.00897","created_at":"2026-05-18T00:22:44.197093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00897v2","created_at":"2026-05-18T00:22:44.197093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00897","created_at":"2026-05-18T00:22:44.197093+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSBRIG4KCAPU","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSBRIG4KCAPUMZ4S","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSBRIG4K","created_at":"2026-05-18T12:32:28.185984+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/HSBRIG4KCAPUMZ4SZRK6SA6PHX","json":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX.json","graph_json":"https://pith.science/api/pith-number/HSBRIG4KCAPUMZ4SZRK6SA6PHX/graph.json","events_json":"https://pith.science/api/pith-number/HSBRIG4KCAPUMZ4SZRK6SA6PHX/events.json","paper":"https://pith.science/paper/HSBRIG4K"},"agent_actions":{"view_html":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX","download_json":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX.json","view_paper":"https://pith.science/paper/HSBRIG4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00897&json=true","fetch_graph":"https://pith.science/api/pith-number/HSBRIG4KCAPUMZ4SZRK6SA6PHX/graph.json","fetch_events":"https://pith.science/api/pith-number/HSBRIG4KCAPUMZ4SZRK6SA6PHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX/action/storage_attestation","attest_author":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX/action/author_attestation","sign_citation":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX/action/citation_signature","submit_replication":"https://pith.science/pith/HSBRIG4KCAPUMZ4SZRK6SA6PHX/action/replication_record"}},"created_at":"2026-05-18T00:22:44.197093+00:00","updated_at":"2026-05-18T00:22:44.197093+00:00"}