{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SWD7VYOT76XP3USEZXSJNHHXBG","short_pith_number":"pith:SWD7VYOT","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"},"canonical_sha256":"9587fae1d3ffaefdd244cde4969cf7098a2bf3025c34ff3d73f3fe095c181ba9","source":{"kind":"arxiv","id":"1709.02486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02486","created_at":"2026-05-18T00:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02486v1","created_at":"2026-05-18T00:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02486","created_at":"2026-05-18T00:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"SWD7VYOT76XP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SWD7VYOT76XP3USE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SWD7VYOT","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SWD7VYOT76XP3USEZXSJNHHXBG","target":"record","payload":{"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"},"canonical_sha256":"9587fae1d3ffaefdd244cde4969cf7098a2bf3025c34ff3d73f3fe095c181ba9","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"},"source_kind":"arxiv","source_id":"1709.02486","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"leVg5ZigEXsxXtW9ZwgRND+YtPi9lLUSi85bL4BCkFlS7+IktHTbgNM1Q2DZChEi3pf39fp7+Yk3K3IgExKgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:23:57.858209Z"},"content_sha256":"d1f6b29650a3a9f55be625a94ad6d983df3160bd1708b671835062fc67f986a1","schema_version":"1.0","event_id":"sha256:d1f6b29650a3a9f55be625a94ad6d983df3160bd1708b671835062fc67f986a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SWD7VYOT76XP3USEZXSJNHHXBG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:35:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPBOw6m9CrPaH400Xk/Ye5HLFIS4oC0C0Us532xJfYLQoy8AGcnlWJ5ITvHjlQENj9XdfUQm1wOPrvrgKvtrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:23:57.858747Z"},"content_sha256":"521a5a74fe1451543d92f5a2f902f0bc55feeea3af6419a3331c680a3291a734","schema_version":"1.0","event_id":"sha256:521a5a74fe1451543d92f5a2f902f0bc55feeea3af6419a3331c680a3291a734"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/bundle.json","state_url":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWD7VYOT76XP3USEZXSJNHHXBG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T01:23:57Z","links":{"resolver":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG","bundle":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/bundle.json","state":"https://pith.science/pith/SWD7VYOT76XP3USEZXSJNHHXBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWD7VYOT76XP3USEZXSJNHHXBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SWD7VYOT76XP3USEZXSJNHHXBG","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":"2d49a1d0bc24c49d967bdf210ba363f67801511898809e1ca5f354b80b755227","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-07T23:28:15Z","title_canon_sha256":"0ef4ff465dcc5c2329999b4e33ca193fb09a105f2cc682994f7754ca2ed0d9e0"},"schema_version":"1.0","source":{"id":"1709.02486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02486","created_at":"2026-05-18T00:35:45Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02486v1","created_at":"2026-05-18T00:35:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02486","created_at":"2026-05-18T00:35:45Z"},{"alias_kind":"pith_short_12","alias_value":"SWD7VYOT76XP","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SWD7VYOT76XP3USE","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SWD7VYOT","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:521a5a74fe1451543d92f5a2f902f0bc55feeea3af6419a3331c680a3291a734","target":"graph","created_at":"2026-05-18T00:35:45Z","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":"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.","authors_text":"Francesco Rinaldi, James T. Hungerford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-07T23:28:15Z","title":"A General Regularized Continuous Formulation for the Maximum Clique Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02486","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:d1f6b29650a3a9f55be625a94ad6d983df3160bd1708b671835062fc67f986a1","target":"record","created_at":"2026-05-18T00:35:45Z","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":"2d49a1d0bc24c49d967bdf210ba363f67801511898809e1ca5f354b80b755227","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-07T23:28:15Z","title_canon_sha256":"0ef4ff465dcc5c2329999b4e33ca193fb09a105f2cc682994f7754ca2ed0d9e0"},"schema_version":"1.0","source":{"id":"1709.02486","kind":"arxiv","version":1}},"canonical_sha256":"9587fae1d3ffaefdd244cde4969cf7098a2bf3025c34ff3d73f3fe095c181ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9587fae1d3ffaefdd244cde4969cf7098a2bf3025c34ff3d73f3fe095c181ba9","first_computed_at":"2026-05-18T00:35:45.624440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:45.624440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aSquThn+35y4uRwy+NzprMdm2mDL77gMKoXnXlls3nBT7INct+2FvHRyUh2bgiuMt2adURYnmqfoJunyExNbDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:45.625199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1f6b29650a3a9f55be625a94ad6d983df3160bd1708b671835062fc67f986a1","sha256:521a5a74fe1451543d92f5a2f902f0bc55feeea3af6419a3331c680a3291a734"],"state_sha256":"de967fa0163275ff22f9a05d9e536815d3a7ce68f768ae592125f36b64cfe239"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gE2X7JMhnIdSiY0PP8dTVuiTrUJI99jOd9wxlS9j2lNdODaTUHaFnfctEFyzH6sJTv2gjQSlqnuzXfmhnx8PBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:23:57.861656Z","bundle_sha256":"b0aa8772f058b942182aa6385d402580f149b5b0ae20218a1232393f1d6d9fd0"}}