{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XCP4ZYSHCO3KSMQY44Z46LAX4M","short_pith_number":"pith:XCP4ZYSH","schema_version":"1.0","canonical_sha256":"b89fcce24713b6a93218e733cf2c17e32eb87c49483b2149dfeb8d7b18544e3e","source":{"kind":"arxiv","id":"1704.04581","version":3},"attestation_state":"computed","paper":{"title":"A Quadratic Penalty Method for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chunfeng Cui, Hong Yan, Liqun Qi, Qingna Li","submitted_at":"2017-04-15T04:58:52Z","abstract_excerpt":"Hypergraph matching is a fundamental problem in computer vision. Mathematically speaking, it maximizes a polynomial objective function, subject to assignment constraints. In this paper, we reformulate the hypergraph matching problem as a sparse constrained tensor optimization problem. The optimality conditions are characterized based on the sparse constrained optimization theory. By dropping the sparsity constraint, we show that the resulting relaxation problem can recover the global minimizer of the original problem. The critical step in solving the original problem is to identify the locatio"},"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":"1704.04581","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T04:58:52Z","cross_cats_sorted":[],"title_canon_sha256":"14d157c1f46f0bed971d986d0ac55095f9505dcc60124631e538a55f13a2d671","abstract_canon_sha256":"af963d5c2dd9cd19027584ba65d4784e924ab49069356aa0e588e63ef9c25e4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:45.178456Z","signature_b64":"tcPBRyn6cK2ZYgjbxBdkTU0dj9u67WR2Egsa9EbsiaAt+OMKHUK/zNDDFnWcR0KcL0CHCYX7WV2Ygb6FDHRdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89fcce24713b6a93218e733cf2c17e32eb87c49483b2149dfeb8d7b18544e3e","last_reissued_at":"2026-05-18T00:30:45.178044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:45.178044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quadratic Penalty Method for Hypergraph Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chunfeng Cui, Hong Yan, Liqun Qi, Qingna Li","submitted_at":"2017-04-15T04:58:52Z","abstract_excerpt":"Hypergraph matching is a fundamental problem in computer vision. Mathematically speaking, it maximizes a polynomial objective function, subject to assignment constraints. In this paper, we reformulate the hypergraph matching problem as a sparse constrained tensor optimization problem. The optimality conditions are characterized based on the sparse constrained optimization theory. By dropping the sparsity constraint, we show that the resulting relaxation problem can recover the global minimizer of the original problem. The critical step in solving the original problem is to identify the locatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04581","kind":"arxiv","version":3},"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":"1704.04581","created_at":"2026-05-18T00:30:45.178102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04581v3","created_at":"2026-05-18T00:30:45.178102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04581","created_at":"2026-05-18T00:30:45.178102+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCP4ZYSHCO3K","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCP4ZYSHCO3KSMQY","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCP4ZYSH","created_at":"2026-05-18T12:31:53.515858+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/XCP4ZYSHCO3KSMQY44Z46LAX4M","json":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M.json","graph_json":"https://pith.science/api/pith-number/XCP4ZYSHCO3KSMQY44Z46LAX4M/graph.json","events_json":"https://pith.science/api/pith-number/XCP4ZYSHCO3KSMQY44Z46LAX4M/events.json","paper":"https://pith.science/paper/XCP4ZYSH"},"agent_actions":{"view_html":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M","download_json":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M.json","view_paper":"https://pith.science/paper/XCP4ZYSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04581&json=true","fetch_graph":"https://pith.science/api/pith-number/XCP4ZYSHCO3KSMQY44Z46LAX4M/graph.json","fetch_events":"https://pith.science/api/pith-number/XCP4ZYSHCO3KSMQY44Z46LAX4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M/action/storage_attestation","attest_author":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M/action/author_attestation","sign_citation":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M/action/citation_signature","submit_replication":"https://pith.science/pith/XCP4ZYSHCO3KSMQY44Z46LAX4M/action/replication_record"}},"created_at":"2026-05-18T00:30:45.178102+00:00","updated_at":"2026-05-18T00:30:45.178102+00:00"}