{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YUIHCMAX6P4L7O2VZHHBYXFIPF","short_pith_number":"pith:YUIHCMAX","schema_version":"1.0","canonical_sha256":"c510713017f3f8bfbb55c9ce1c5ca8796527bef1df899e84c1017fe67f48de14","source":{"kind":"arxiv","id":"1908.07234","version":1},"attestation_state":"computed","paper":{"title":"Statistical mechanics of the minimum vertex cover problem in stochastic block models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Masato Suzuki, Yoshiyuki Kabashima","submitted_at":"2019-08-20T09:19:26Z","abstract_excerpt":"The minimum vertex cover (Min-VC) problem is a well-known NP-hard problem. Earlier studies illustrate that the problem defined over the Erd\\\"{o}s-R\\'{e}nyi random graph with a mean degree $c$ exhibits computational difficulty in searching the Min-VC set above a critical point $c = e = 2.718 \\ldots$. Here, we address how this difficulty is influenced by the mesoscopic structures of graphs. For this, we evaluate the critical condition of difficulty for the stochastic block model. We perform a detailed examination of the specific cases of two equal-size communities characterized by in- and out- d"},"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":"1908.07234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-08-20T09:19:26Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"e0688fb5bcb9869e408a18fbaac93c8cbe5d0db986ec2791f55fe85cf2b26f30","abstract_canon_sha256":"1071b3510b543526921e88e6b1d5241dbf9550880b0f6957b40b4187ef18ecf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:14.214703Z","signature_b64":"yw+QQTN9UTX8NuaXXqOxBrrZ5hck5DWM6zK6vWc+rubNXQlg7ksmYmr8xKPRHaNtFHL0on4PNZPbqBBseXqXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c510713017f3f8bfbb55c9ce1c5ca8796527bef1df899e84c1017fe67f48de14","last_reissued_at":"2026-07-05T00:25:14.214231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:14.214231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical mechanics of the minimum vertex cover problem in stochastic block models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"Masato Suzuki, Yoshiyuki Kabashima","submitted_at":"2019-08-20T09:19:26Z","abstract_excerpt":"The minimum vertex cover (Min-VC) problem is a well-known NP-hard problem. Earlier studies illustrate that the problem defined over the Erd\\\"{o}s-R\\'{e}nyi random graph with a mean degree $c$ exhibits computational difficulty in searching the Min-VC set above a critical point $c = e = 2.718 \\ldots$. Here, we address how this difficulty is influenced by the mesoscopic structures of graphs. For this, we evaluate the critical condition of difficulty for the stochastic block model. We perform a detailed examination of the specific cases of two equal-size communities characterized by in- and out- d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07234","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/1908.07234/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.07234","created_at":"2026-07-05T00:25:14.214291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07234v1","created_at":"2026-07-05T00:25:14.214291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07234","created_at":"2026-07-05T00:25:14.214291+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUIHCMAX6P4L","created_at":"2026-07-05T00:25:14.214291+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUIHCMAX6P4L7O2V","created_at":"2026-07-05T00:25:14.214291+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUIHCMAX","created_at":"2026-07-05T00:25:14.214291+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/YUIHCMAX6P4L7O2VZHHBYXFIPF","json":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF.json","graph_json":"https://pith.science/api/pith-number/YUIHCMAX6P4L7O2VZHHBYXFIPF/graph.json","events_json":"https://pith.science/api/pith-number/YUIHCMAX6P4L7O2VZHHBYXFIPF/events.json","paper":"https://pith.science/paper/YUIHCMAX"},"agent_actions":{"view_html":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF","download_json":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF.json","view_paper":"https://pith.science/paper/YUIHCMAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07234&json=true","fetch_graph":"https://pith.science/api/pith-number/YUIHCMAX6P4L7O2VZHHBYXFIPF/graph.json","fetch_events":"https://pith.science/api/pith-number/YUIHCMAX6P4L7O2VZHHBYXFIPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/action/storage_attestation","attest_author":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/action/author_attestation","sign_citation":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/action/citation_signature","submit_replication":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/action/replication_record"}},"created_at":"2026-07-05T00:25:14.214291+00:00","updated_at":"2026-07-05T00:25:14.214291+00:00"}