{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SWD7VYOT76XP3USEZXSJNHHXBG","short_pith_number":"pith:SWD7VYOT","schema_version":"1.0","canonical_sha256":"9587fae1d3ffaefdd244cde4969cf7098a2bf3025c34ff3d73f3fe095c181ba9","source":{"kind":"arxiv","id":"1709.02486","version":1},"attestation_state":"computed","paper":{"title":"A General Regularized Continuous Formulation for the Maximum Clique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Rinaldi, James T. Hungerford","submitted_at":"2017-09-07T23:28:15Z","abstract_excerpt":"In this paper, we develop a general regularization-based continuous optimization framework for the maximum clique problem. In particular, we consider a broad class of regularization terms that can be included in the classic Motzkin-Strauss formulation and we develop conditions that guarantee the equivalence between the continuous regularized problem and the original one in both a global and a local sense. We further analyze, from a computational point of view, two different regularizers that satisfy the general conditions."},"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":"1709.02486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-07T23:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"0ef4ff465dcc5c2329999b4e33ca193fb09a105f2cc682994f7754ca2ed0d9e0","abstract_canon_sha256":"2d49a1d0bc24c49d967bdf210ba363f67801511898809e1ca5f354b80b755227"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:45.625199Z","signature_b64":"aSquThn+35y4uRwy+NzprMdm2mDL77gMKoXnXlls3nBT7INct+2FvHRyUh2bgiuMt2adURYnmqfoJunyExNbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9587fae1d3ffaefdd244cde4969cf7098a2bf3025c34ff3d73f3fe095c181ba9","last_reissued_at":"2026-05-18T00:35:45.624440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:45.624440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Regularized Continuous Formulation for the Maximum Clique Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Rinaldi, James T. Hungerford","submitted_at":"2017-09-07T23:28:15Z","abstract_excerpt":"In this paper, we develop a general regularization-based continuous optimization framework for the maximum clique problem. In particular, we consider a broad class of regularization terms that can be included in the classic Motzkin-Strauss formulation and we develop conditions that guarantee the equivalence between the continuous regularized problem and the original one in both a global and a local sense. We further analyze, from a computational point of view, two different regularizers that satisfy the general conditions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02486","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":"1709.02486","created_at":"2026-05-18T00:35:45.624557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02486v1","created_at":"2026-05-18T00:35:45.624557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02486","created_at":"2026-05-18T00:35:45.624557+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWD7VYOT76XP","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWD7VYOT76XP3USE","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWD7VYOT","created_at":"2026-05-18T12:31:43.269735+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/SWD7VYOT76XP3USEZXSJNHHXBG","json":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG.json","graph_json":"https://pith.science/api/pith-number/SWD7VYOT76XP3USEZXSJNHHXBG/graph.json","events_json":"https://pith.science/api/pith-number/SWD7VYOT76XP3USEZXSJNHHXBG/events.json","paper":"https://pith.science/paper/SWD7VYOT"},"agent_actions":{"view_html":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG","download_json":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG.json","view_paper":"https://pith.science/paper/SWD7VYOT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02486&json=true","fetch_graph":"https://pith.science/api/pith-number/SWD7VYOT76XP3USEZXSJNHHXBG/graph.json","fetch_events":"https://pith.science/api/pith-number/SWD7VYOT76XP3USEZXSJNHHXBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/action/storage_attestation","attest_author":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/action/author_attestation","sign_citation":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/action/citation_signature","submit_replication":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/action/replication_record"}},"created_at":"2026-05-18T00:35:45.624557+00:00","updated_at":"2026-05-18T00:35:45.624557+00:00"}