{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HELGOACTQEXN3HTYQWLNPIBOD7","short_pith_number":"pith:HELGOACT","canonical_record":{"source":{"id":"2307.09022","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-18T07:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"8d12838dd0796236815a9f78d3e358e150c7b318e665d9f9b64c08a4c198bdbe","abstract_canon_sha256":"bcdc810b25820a75204a1b040e4f4f7aeb5ad0851bd2b5574942da4bee7df983"},"schema_version":"1.0"},"canonical_sha256":"3916670053812edd9e788596d7a02e1fc8e3d414d1c806d2a36f978fe1b76f15","source":{"kind":"arxiv","id":"2307.09022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.09022","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"arxiv_version","alias_value":"2307.09022v1","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.09022","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"pith_short_12","alias_value":"HELGOACTQEXN","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"pith_short_16","alias_value":"HELGOACTQEXN3HTY","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"pith_short_8","alias_value":"HELGOACT","created_at":"2026-07-05T06:31:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HELGOACTQEXN3HTYQWLNPIBOD7","target":"record","payload":{"canonical_record":{"source":{"id":"2307.09022","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-18T07:21:49Z","cross_cats_sorted":[],"title_canon_sha256":"8d12838dd0796236815a9f78d3e358e150c7b318e665d9f9b64c08a4c198bdbe","abstract_canon_sha256":"bcdc810b25820a75204a1b040e4f4f7aeb5ad0851bd2b5574942da4bee7df983"},"schema_version":"1.0"},"canonical_sha256":"3916670053812edd9e788596d7a02e1fc8e3d414d1c806d2a36f978fe1b76f15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:38.043712Z","signature_b64":"Xh/MfSwJMoC2sD+WvncwmADaRQG+ZrERjysfO4cvuMDwUhlFCTCa0J3sPX8ZIvMUhTDMrSetCSamp+PD2XOeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3916670053812edd9e788596d7a02e1fc8e3d414d1c806d2a36f978fe1b76f15","last_reissued_at":"2026-07-05T06:31:38.043087Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:38.043087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.09022","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-07-05T06:31:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RItadx0WlsFALPY78TEyPoQGKmXNWOW/QQLaGD/KsrnjQw/vi5BH6LeO8EbPA7hHOr59lzfwTCJ/vRvT5M5yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:17:59.630207Z"},"content_sha256":"b76ae3273edd4103956f5112bd7b6fee80e3a8c5f138f39d108b6f155151b1a5","schema_version":"1.0","event_id":"sha256:b76ae3273edd4103956f5112bd7b6fee80e3a8c5f138f39d108b6f155151b1a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HELGOACTQEXN3HTYQWLNPIBOD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Montaz Ali, Salma Omer","submitted_at":"2023-07-18T07:21:49Z","abstract_excerpt":"We consider the problem of identifying a maximum clique in a given graph. We have proposed a mathematical model for this problem. The model resembles the matrix decomposition of the adjacency matrix of a given graph. The objective function of the mathematical model includes a weighted $\\ell_{1}$-norm of the sparse matrix of the decomposition, which has an advantage over the known $\\ell_{1}-$norm in reducing the error. The use of dynamically changing the weights for the $\\ell_{1}$-norm has been motivated. We have used proximal operators within the iterates of the ADMM (alternating direction met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.09022","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.09022/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:31:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxIFDZ1w8eZZXgCgRIlS4LrvSwx1Yz375eGveKEt0eqFAy3ZI5r4+nEIWT9bhyVixflm4Uekqwh2+APCFqyJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:17:59.630697Z"},"content_sha256":"35a7f3251b2abacdf158d91f4ef2ad6df0d86fe0f6d50e49d0edda1d49d1b2cc","schema_version":"1.0","event_id":"sha256:35a7f3251b2abacdf158d91f4ef2ad6df0d86fe0f6d50e49d0edda1d49d1b2cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HELGOACTQEXN3HTYQWLNPIBOD7/bundle.json","state_url":"https://pith.science/pith/HELGOACTQEXN3HTYQWLNPIBOD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HELGOACTQEXN3HTYQWLNPIBOD7/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-08-24T03:17:59Z","links":{"resolver":"https://pith.science/pith/HELGOACTQEXN3HTYQWLNPIBOD7","bundle":"https://pith.science/pith/HELGOACTQEXN3HTYQWLNPIBOD7/bundle.json","state":"https://pith.science/pith/HELGOACTQEXN3HTYQWLNPIBOD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HELGOACTQEXN3HTYQWLNPIBOD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HELGOACTQEXN3HTYQWLNPIBOD7","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":"bcdc810b25820a75204a1b040e4f4f7aeb5ad0851bd2b5574942da4bee7df983","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-18T07:21:49Z","title_canon_sha256":"8d12838dd0796236815a9f78d3e358e150c7b318e665d9f9b64c08a4c198bdbe"},"schema_version":"1.0","source":{"id":"2307.09022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.09022","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"arxiv_version","alias_value":"2307.09022v1","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.09022","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"pith_short_12","alias_value":"HELGOACTQEXN","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"pith_short_16","alias_value":"HELGOACTQEXN3HTY","created_at":"2026-07-05T06:31:38Z"},{"alias_kind":"pith_short_8","alias_value":"HELGOACT","created_at":"2026-07-05T06:31:38Z"}],"graph_snapshots":[{"event_id":"sha256:35a7f3251b2abacdf158d91f4ef2ad6df0d86fe0f6d50e49d0edda1d49d1b2cc","target":"graph","created_at":"2026-07-05T06:31:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.09022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of identifying a maximum clique in a given graph. We have proposed a mathematical model for this problem. The model resembles the matrix decomposition of the adjacency matrix of a given graph. The objective function of the mathematical model includes a weighted $\\ell_{1}$-norm of the sparse matrix of the decomposition, which has an advantage over the known $\\ell_{1}-$norm in reducing the error. The use of dynamically changing the weights for the $\\ell_{1}$-norm has been motivated. We have used proximal operators within the iterates of the ADMM (alternating direction met","authors_text":"Montaz Ali, Salma Omer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-18T07:21:49Z","title":"Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.09022","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:b76ae3273edd4103956f5112bd7b6fee80e3a8c5f138f39d108b6f155151b1a5","target":"record","created_at":"2026-07-05T06:31:38Z","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":"bcdc810b25820a75204a1b040e4f4f7aeb5ad0851bd2b5574942da4bee7df983","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-18T07:21:49Z","title_canon_sha256":"8d12838dd0796236815a9f78d3e358e150c7b318e665d9f9b64c08a4c198bdbe"},"schema_version":"1.0","source":{"id":"2307.09022","kind":"arxiv","version":1}},"canonical_sha256":"3916670053812edd9e788596d7a02e1fc8e3d414d1c806d2a36f978fe1b76f15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3916670053812edd9e788596d7a02e1fc8e3d414d1c806d2a36f978fe1b76f15","first_computed_at":"2026-07-05T06:31:38.043087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:31:38.043087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xh/MfSwJMoC2sD+WvncwmADaRQG+ZrERjysfO4cvuMDwUhlFCTCa0J3sPX8ZIvMUhTDMrSetCSamp+PD2XOeBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:31:38.043712Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.09022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b76ae3273edd4103956f5112bd7b6fee80e3a8c5f138f39d108b6f155151b1a5","sha256:35a7f3251b2abacdf158d91f4ef2ad6df0d86fe0f6d50e49d0edda1d49d1b2cc"],"state_sha256":"8d08fc30d4d8640873934916dec69426fb098ed2dadd99f34bb0c594aa7df290"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJYesmsciECLpzdl+Y7rbdgJ38Y/8Ez/N6fhZyrihmL5kWBwdOeqDZz5PCt4knGTFGto/G/Z2NcLFmRrWS0JCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:17:59.635237Z","bundle_sha256":"6c6fa4d6793acb838ec1551c7967be5d89f922af405dc99886ab101f488a20bb"}}