{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LE5MO6QFZVAI6AB37YO4LWA5JJ","short_pith_number":"pith:LE5MO6QF","schema_version":"1.0","canonical_sha256":"593ac77a05cd408f003bfe1dc5d81d4a74ae43c74927a939114229499b604b08","source":{"kind":"arxiv","id":"1308.6388","version":1},"attestation_state":"computed","paper":{"title":"GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hong Qiao, Zhi-yong Liu","submitted_at":"2013-08-29T08:00:20Z","abstract_excerpt":"In this paper we propose the Graduated NonConvexity and Graduated Concavity Procedure (GNCGCP) as a general optimization framework to approximately solve the combinatorial optimization problems on the set of partial permutation matrices. GNCGCP comprises two sub-procedures, graduated nonconvexity (GNC) which realizes a convex relaxation and graduated concavity (GC) which realizes a concave relaxation. It is proved that GNCGCP realizes exactly a type of convex-concave relaxation procedure (CCRP), but with a much simpler formulation without needing convex or concave relaxation in an explicit way"},"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":"1308.6388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-08-29T08:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"6a6892be95647f650408dba34c724102d0e823d3a54f9a7ae6703e8a97228167","abstract_canon_sha256":"a4fd7b064cbc79f600a6ed0dff07a6f38148a2f96b19c13f0f072ae0902250c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:40.086692Z","signature_b64":"hiTQAF/eMtsJgpogDVr/mlz+q3zF4mP/+o7ONNushc3TjQkcsSo8Nf6rXbS3PuqUZUtPp1t85n5Kiym3SQNCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"593ac77a05cd408f003bfe1dc5d81d4a74ae43c74927a939114229499b604b08","last_reissued_at":"2026-05-18T03:14:40.086016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:40.086016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hong Qiao, Zhi-yong Liu","submitted_at":"2013-08-29T08:00:20Z","abstract_excerpt":"In this paper we propose the Graduated NonConvexity and Graduated Concavity Procedure (GNCGCP) as a general optimization framework to approximately solve the combinatorial optimization problems on the set of partial permutation matrices. GNCGCP comprises two sub-procedures, graduated nonconvexity (GNC) which realizes a convex relaxation and graduated concavity (GC) which realizes a concave relaxation. It is proved that GNCGCP realizes exactly a type of convex-concave relaxation procedure (CCRP), but with a much simpler formulation without needing convex or concave relaxation in an explicit way"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6388","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":"1308.6388","created_at":"2026-05-18T03:14:40.086124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6388v1","created_at":"2026-05-18T03:14:40.086124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6388","created_at":"2026-05-18T03:14:40.086124+00:00"},{"alias_kind":"pith_short_12","alias_value":"LE5MO6QFZVAI","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LE5MO6QFZVAI6AB3","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LE5MO6QF","created_at":"2026-05-18T12:27:51.066281+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/LE5MO6QFZVAI6AB37YO4LWA5JJ","json":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ.json","graph_json":"https://pith.science/api/pith-number/LE5MO6QFZVAI6AB37YO4LWA5JJ/graph.json","events_json":"https://pith.science/api/pith-number/LE5MO6QFZVAI6AB37YO4LWA5JJ/events.json","paper":"https://pith.science/paper/LE5MO6QF"},"agent_actions":{"view_html":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ","download_json":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ.json","view_paper":"https://pith.science/paper/LE5MO6QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6388&json=true","fetch_graph":"https://pith.science/api/pith-number/LE5MO6QFZVAI6AB37YO4LWA5JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LE5MO6QFZVAI6AB37YO4LWA5JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ/action/storage_attestation","attest_author":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ/action/author_attestation","sign_citation":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ/action/citation_signature","submit_replication":"https://pith.science/pith/LE5MO6QFZVAI6AB37YO4LWA5JJ/action/replication_record"}},"created_at":"2026-05-18T03:14:40.086124+00:00","updated_at":"2026-05-18T03:14:40.086124+00:00"}