{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:T4WUKMLXMF5SXJZDKLXAY7ZOFU","short_pith_number":"pith:T4WUKMLX","canonical_record":{"source":{"id":"1301.5769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-01-24T12:24:06Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"20c6f0f7404a953ac7e6ac0a8f13216be430b70472d9c7619bc86dac5f4cea36","abstract_canon_sha256":"5c8e7ba9b1e87a90ac496d3ea0cd8a4f69dabdff001e02c328236e4ae3ba25f7"},"schema_version":"1.0"},"canonical_sha256":"9f2d453177617b2ba72352ee0c7f2e2d1b8d77c6ef9429d7d910d4192767c293","source":{"kind":"arxiv","id":"1301.5769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5769","created_at":"2026-05-18T02:48:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5769v1","created_at":"2026-05-18T02:48:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5769","created_at":"2026-05-18T02:48:27Z"},{"alias_kind":"pith_short_12","alias_value":"T4WUKMLXMF5S","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T4WUKMLXMF5SXJZD","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T4WUKMLX","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:T4WUKMLXMF5SXJZDKLXAY7ZOFU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.5769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-01-24T12:24:06Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"20c6f0f7404a953ac7e6ac0a8f13216be430b70472d9c7619bc86dac5f4cea36","abstract_canon_sha256":"5c8e7ba9b1e87a90ac496d3ea0cd8a4f69dabdff001e02c328236e4ae3ba25f7"},"schema_version":"1.0"},"canonical_sha256":"9f2d453177617b2ba72352ee0c7f2e2d1b8d77c6ef9429d7d910d4192767c293","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:27.476446Z","signature_b64":"F79+sBuE3Wu4GQ1zPqz1ATuphh5hhqRZNEscZhbUDHX9CSQlFsyI+7atmDK3dMVEoS4IekWpxBVPY51a0PlnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2d453177617b2ba72352ee0c7f2e2d1b8d77c6ef9429d7d910d4192767c293","last_reissued_at":"2026-05-18T02:48:27.475855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:27.475855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.5769","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-18T02:48:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzQTCOKFKR14tsm6qKU/8+k1IAsyPplFaJWDNkxt1LEZFt1oDSbLP7C1rdhIM2yY8oxBn4wsDsS7g0VMz4g4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:22:18.179766Z"},"content_sha256":"9fecb20b8ed6e884d7c1015c6246bc4408d6ec7210696166b525640023d77b67","schema_version":"1.0","event_id":"sha256:9fecb20b8ed6e884d7c1015c6246bc4408d6ec7210696166b525640023d77b67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:T4WUKMLXMF5SXJZDKLXAY7ZOFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Koji Hukushima, Satoshi Takabe","submitted_at":"2013-01-24T12:24:06Z","abstract_excerpt":"We study minimum vertex cover problems on random \\alpha-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase transition at the critical average degree e/(\\alpha-1). Below the critical degree, a replica symmetric ansatz in the statistical-mechanical method holdsand the algorithm estimates a solution of the problem which coincide with that by the replica method. In contrast, above the critical degree, the replica symmetric solution becomes unstable and these methods fail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5769","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-18T02:48:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAfdhsoIHnkabP/+eHJc39audCgY4eHTAHLlHG7Ef2OF9hgETgTPEZFJpBcw2/bsaCtD+2KRs3QyqfEYPgBxAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:22:18.180117Z"},"content_sha256":"f2855e24f2b1289378c80a60d7efc542a3c4c34b1e76fce44275644be836e740","schema_version":"1.0","event_id":"sha256:f2855e24f2b1289378c80a60d7efc542a3c4c34b1e76fce44275644be836e740"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/bundle.json","state_url":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/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-02T15:22:18Z","links":{"resolver":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU","bundle":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/bundle.json","state":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:T4WUKMLXMF5SXJZDKLXAY7ZOFU","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":"5c8e7ba9b1e87a90ac496d3ea0cd8a4f69dabdff001e02c328236e4ae3ba25f7","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-01-24T12:24:06Z","title_canon_sha256":"20c6f0f7404a953ac7e6ac0a8f13216be430b70472d9c7619bc86dac5f4cea36"},"schema_version":"1.0","source":{"id":"1301.5769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.5769","created_at":"2026-05-18T02:48:27Z"},{"alias_kind":"arxiv_version","alias_value":"1301.5769v1","created_at":"2026-05-18T02:48:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5769","created_at":"2026-05-18T02:48:27Z"},{"alias_kind":"pith_short_12","alias_value":"T4WUKMLXMF5S","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T4WUKMLXMF5SXJZD","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T4WUKMLX","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:f2855e24f2b1289378c80a60d7efc542a3c4c34b1e76fce44275644be836e740","target":"graph","created_at":"2026-05-18T02:48:27Z","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":"We study minimum vertex cover problems on random \\alpha-uniform hypergraphs using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase transition at the critical average degree e/(\\alpha-1). Below the critical degree, a replica symmetric ansatz in the statistical-mechanical method holdsand the algorithm estimates a solution of the problem which coincide with that by the replica method. In contrast, above the critical degree, the replica symmetric solution becomes unstable and these methods fail","authors_text":"Koji Hukushima, Satoshi Takabe","cross_cats":["cond-mat.stat-mech"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-01-24T12:24:06Z","title":"Minimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5769","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:9fecb20b8ed6e884d7c1015c6246bc4408d6ec7210696166b525640023d77b67","target":"record","created_at":"2026-05-18T02:48:27Z","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":"5c8e7ba9b1e87a90ac496d3ea0cd8a4f69dabdff001e02c328236e4ae3ba25f7","cross_cats_sorted":["cond-mat.stat-mech"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-01-24T12:24:06Z","title_canon_sha256":"20c6f0f7404a953ac7e6ac0a8f13216be430b70472d9c7619bc86dac5f4cea36"},"schema_version":"1.0","source":{"id":"1301.5769","kind":"arxiv","version":1}},"canonical_sha256":"9f2d453177617b2ba72352ee0c7f2e2d1b8d77c6ef9429d7d910d4192767c293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f2d453177617b2ba72352ee0c7f2e2d1b8d77c6ef9429d7d910d4192767c293","first_computed_at":"2026-05-18T02:48:27.475855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:27.475855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F79+sBuE3Wu4GQ1zPqz1ATuphh5hhqRZNEscZhbUDHX9CSQlFsyI+7atmDK3dMVEoS4IekWpxBVPY51a0PlnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:27.476446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.5769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fecb20b8ed6e884d7c1015c6246bc4408d6ec7210696166b525640023d77b67","sha256:f2855e24f2b1289378c80a60d7efc542a3c4c34b1e76fce44275644be836e740"],"state_sha256":"fded041899ee42535301158be66381a4e78651b0f99d63571c1b22f11d1d0fe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXstrq4qU0uyRs8QaNICEWNtL3ZrsjwcVB9KHSvQkUqCbXS4pczY4WHPgR8dmQKr6eemiS5pWq7lDsSYVZoOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:22:18.182119Z","bundle_sha256":"8592f7de9ed04ef48537198f899ecdbbc60b0ef767a3a6c2ca7b55e81d1d753e"}}