{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Z7BD3ONEEQ2AI2KGTMZWXJVIUE","short_pith_number":"pith:Z7BD3ONE","canonical_record":{"source":{"id":"1509.00824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-02T19:10:00Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"a6d92df4403898132786ff62cdd34dc410651076ec368e402542f468d9af4abe","abstract_canon_sha256":"03ee6f810e93a273cc91cb52a8b9a3cf2b1082a64009ffb350cc912f2a61b7bf"},"schema_version":"1.0"},"canonical_sha256":"cfc23db9a424340469469b336ba6a8a13be10974a556740d8a623c7e33cf35c8","source":{"kind":"arxiv","id":"1509.00824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00824","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00824v1","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00824","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"Z7BD3ONEEQ2A","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z7BD3ONEEQ2AI2KG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z7BD3ONE","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Z7BD3ONEEQ2AI2KGTMZWXJVIUE","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-02T19:10:00Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"a6d92df4403898132786ff62cdd34dc410651076ec368e402542f468d9af4abe","abstract_canon_sha256":"03ee6f810e93a273cc91cb52a8b9a3cf2b1082a64009ffb350cc912f2a61b7bf"},"schema_version":"1.0"},"canonical_sha256":"cfc23db9a424340469469b336ba6a8a13be10974a556740d8a623c7e33cf35c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:05.941933Z","signature_b64":"XOtLtVqumTv8mc9dxHbR7xzbo1JMpYtV/FDDfaMEXwKiWy3gOxbwdXVyByZlmjaHPwgsMPxRUnS9qy3LTRFsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfc23db9a424340469469b336ba6a8a13be10974a556740d8a623c7e33cf35c8","last_reissued_at":"2026-05-18T01:34:05.941454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:05.941454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00824","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-18T01:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhoRU7HtjA87B68GEyp3N7YBMcAPybhjmIBrvcuohl061jSlPh6CJDBQN4U14oeqwUEYpdBS13gfW22KRk/sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:56:09.657088Z"},"content_sha256":"89bd74671f0379ef2d42aa2631e28235758bc703738e0be9196c399960533691","schema_version":"1.0","event_id":"sha256:89bd74671f0379ef2d42aa2631e28235758bc703738e0be9196c399960533691"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Z7BD3ONEEQ2AI2KGTMZWXJVIUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on Probably Certifiably Correct algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"math.OC","authors_text":"Afonso S. Bandeira","submitted_at":"2015-09-02T19:10:00Z","abstract_excerpt":"Many optimization problems of interest are known to be intractable, and while there are often heuristics that are known to work on typical instances, it is usually not easy to determine a posteriori whether the optimal solution was found. In this short note, we discuss algorithms that not only solve the problem on typical instances, but also provide a posteriori certificates of optimality, probably certifiably correct (PCC) algorithms. As an illustrative example, we present a fast PCC algorithm for minimum bisection under the stochastic block model and briefly discuss other examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00824","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-18T01:34:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQEk/sTs0ePOpkJQD41CBxJdSL0beYD/WAgxNqZGo+opGvahRwgyaoS7D+9EmfO9IwWaggS/pmAgf2aRoxG2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:56:09.657451Z"},"content_sha256":"966e7cf1e671eff3e1996916cc08be9eb79eb3764ddd2dcac71818bb49f9785c","schema_version":"1.0","event_id":"sha256:966e7cf1e671eff3e1996916cc08be9eb79eb3764ddd2dcac71818bb49f9785c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE/bundle.json","state_url":"https://pith.science/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE/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-05-28T14:56:09Z","links":{"resolver":"https://pith.science/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE","bundle":"https://pith.science/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE/bundle.json","state":"https://pith.science/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7BD3ONEEQ2AI2KGTMZWXJVIUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Z7BD3ONEEQ2AI2KGTMZWXJVIUE","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":"03ee6f810e93a273cc91cb52a8b9a3cf2b1082a64009ffb350cc912f2a61b7bf","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-02T19:10:00Z","title_canon_sha256":"a6d92df4403898132786ff62cdd34dc410651076ec368e402542f468d9af4abe"},"schema_version":"1.0","source":{"id":"1509.00824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00824","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00824v1","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00824","created_at":"2026-05-18T01:34:05Z"},{"alias_kind":"pith_short_12","alias_value":"Z7BD3ONEEQ2A","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"Z7BD3ONEEQ2AI2KG","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"Z7BD3ONE","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:966e7cf1e671eff3e1996916cc08be9eb79eb3764ddd2dcac71818bb49f9785c","target":"graph","created_at":"2026-05-18T01:34:05Z","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":"Many optimization problems of interest are known to be intractable, and while there are often heuristics that are known to work on typical instances, it is usually not easy to determine a posteriori whether the optimal solution was found. In this short note, we discuss algorithms that not only solve the problem on typical instances, but also provide a posteriori certificates of optimality, probably certifiably correct (PCC) algorithms. As an illustrative example, we present a fast PCC algorithm for minimum bisection under the stochastic block model and briefly discuss other examples.","authors_text":"Afonso S. Bandeira","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-02T19:10:00Z","title":"A note on Probably Certifiably Correct algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00824","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:89bd74671f0379ef2d42aa2631e28235758bc703738e0be9196c399960533691","target":"record","created_at":"2026-05-18T01:34:05Z","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":"03ee6f810e93a273cc91cb52a8b9a3cf2b1082a64009ffb350cc912f2a61b7bf","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-09-02T19:10:00Z","title_canon_sha256":"a6d92df4403898132786ff62cdd34dc410651076ec368e402542f468d9af4abe"},"schema_version":"1.0","source":{"id":"1509.00824","kind":"arxiv","version":1}},"canonical_sha256":"cfc23db9a424340469469b336ba6a8a13be10974a556740d8a623c7e33cf35c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfc23db9a424340469469b336ba6a8a13be10974a556740d8a623c7e33cf35c8","first_computed_at":"2026-05-18T01:34:05.941454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:05.941454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XOtLtVqumTv8mc9dxHbR7xzbo1JMpYtV/FDDfaMEXwKiWy3gOxbwdXVyByZlmjaHPwgsMPxRUnS9qy3LTRFsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:05.941933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89bd74671f0379ef2d42aa2631e28235758bc703738e0be9196c399960533691","sha256:966e7cf1e671eff3e1996916cc08be9eb79eb3764ddd2dcac71818bb49f9785c"],"state_sha256":"149064badff20acea21bc82c6615d91b57c09ea57bf352bfa56cf89c6fa7e141"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALvkqx/QlLl86OqN9FkWrZqx/+nSmGivSz9Y3A4iowfj7bzrPQQd4CqZEDKcMfF9gt/jqONlUTylyy8LCWXYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:56:09.659418Z","bundle_sha256":"3f57b4b9e9cd9de5654d996ed4b37d37f91ccdc4c5816d44ac490e56670d2a3d"}}