{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YUIHCMAX6P4L7O2VZHHBYXFIPF","short_pith_number":"pith:YUIHCMAX","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"},"canonical_sha256":"c510713017f3f8bfbb55c9ce1c5ca8796527bef1df899e84c1017fe67f48de14","source":{"kind":"arxiv","id":"1908.07234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07234","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07234v1","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07234","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"pith_short_12","alias_value":"YUIHCMAX6P4L","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"pith_short_16","alias_value":"YUIHCMAX6P4L7O2V","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"pith_short_8","alias_value":"YUIHCMAX","created_at":"2026-07-05T00:25:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YUIHCMAX6P4L7O2VZHHBYXFIPF","target":"record","payload":{"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"},"canonical_sha256":"c510713017f3f8bfbb55c9ce1c5ca8796527bef1df899e84c1017fe67f48de14","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"},"source_kind":"arxiv","source_id":"1908.07234","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-05T00:25:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIC9VtyES3JlzoweVJOGUeUUKWwdkPY5apiNG2ETZqXA/X7PgKDw1u3gAu2rmX+YhPjRtAQ3+uSCmrdfsEkMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:45:44.265555Z"},"content_sha256":"edfd3f0c208deff89a9e5da9c8a44dccbceeaf6f6fb78c71e346af817ab2a786","schema_version":"1.0","event_id":"sha256:edfd3f0c208deff89a9e5da9c8a44dccbceeaf6f6fb78c71e346af817ab2a786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YUIHCMAX6P4L7O2VZHHBYXFIPF","target":"graph","payload":{"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"},"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-05T00:25:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CErfS8Fi29sIZARPMbmzZnbIzznM4jYEYaLL14CwWoEf5iod3isGLLEdNvC3whL0aP58/oL4UPQ4q4BuFq2lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:45:44.266606Z"},"content_sha256":"af58bcbb940be42e9ff3da25e062a56e1d241aa521610f4e78639ab6523b029a","schema_version":"1.0","event_id":"sha256:af58bcbb940be42e9ff3da25e062a56e1d241aa521610f4e78639ab6523b029a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/bundle.json","state_url":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/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-16T12:45:44Z","links":{"resolver":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF","bundle":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/bundle.json","state":"https://pith.science/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YUIHCMAX6P4L7O2VZHHBYXFIPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YUIHCMAX6P4L7O2VZHHBYXFIPF","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":"1071b3510b543526921e88e6b1d5241dbf9550880b0f6957b40b4187ef18ecf8","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-08-20T09:19:26Z","title_canon_sha256":"e0688fb5bcb9869e408a18fbaac93c8cbe5d0db986ec2791f55fe85cf2b26f30"},"schema_version":"1.0","source":{"id":"1908.07234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07234","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07234v1","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07234","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"pith_short_12","alias_value":"YUIHCMAX6P4L","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"pith_short_16","alias_value":"YUIHCMAX6P4L7O2V","created_at":"2026-07-05T00:25:14Z"},{"alias_kind":"pith_short_8","alias_value":"YUIHCMAX","created_at":"2026-07-05T00:25:14Z"}],"graph_snapshots":[{"event_id":"sha256:af58bcbb940be42e9ff3da25e062a56e1d241aa521610f4e78639ab6523b029a","target":"graph","created_at":"2026-07-05T00:25:14Z","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/1908.07234/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Masato Suzuki, Yoshiyuki Kabashima","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-08-20T09:19:26Z","title":"Statistical mechanics of the minimum vertex cover problem in stochastic block models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07234","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:edfd3f0c208deff89a9e5da9c8a44dccbceeaf6f6fb78c71e346af817ab2a786","target":"record","created_at":"2026-07-05T00:25:14Z","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":"1071b3510b543526921e88e6b1d5241dbf9550880b0f6957b40b4187ef18ecf8","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2019-08-20T09:19:26Z","title_canon_sha256":"e0688fb5bcb9869e408a18fbaac93c8cbe5d0db986ec2791f55fe85cf2b26f30"},"schema_version":"1.0","source":{"id":"1908.07234","kind":"arxiv","version":1}},"canonical_sha256":"c510713017f3f8bfbb55c9ce1c5ca8796527bef1df899e84c1017fe67f48de14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c510713017f3f8bfbb55c9ce1c5ca8796527bef1df899e84c1017fe67f48de14","first_computed_at":"2026-07-05T00:25:14.214231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:25:14.214231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yw+QQTN9UTX8NuaXXqOxBrrZ5hck5DWM6zK6vWc+rubNXQlg7ksmYmr8xKPRHaNtFHL0on4PNZPbqBBseXqXDw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:25:14.214703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edfd3f0c208deff89a9e5da9c8a44dccbceeaf6f6fb78c71e346af817ab2a786","sha256:af58bcbb940be42e9ff3da25e062a56e1d241aa521610f4e78639ab6523b029a"],"state_sha256":"7613b73428a372a6954adb3b12f4ad81563b34b77969bbfdad9404f86e8106ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZENBQUuaaX0/AoBUmau0Ylp9rmmtoW5aQYdr8IrBcH7/rZKDwa4YedjrZH8qT9OYo10JBfl+hYY3nC/C5cZeDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:45:44.272413Z","bundle_sha256":"c6ac89a3d1255d0be29bd84714dfac6495a72b27646710863b8b3794af46809c"}}