{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:T4WUKMLXMF5SXJZDKLXAY7ZOFU","short_pith_number":"pith:T4WUKMLX","schema_version":"1.0","canonical_sha256":"9f2d453177617b2ba72352ee0c7f2e2d1b8d77c6ef9429d7d910d4192767c293","source":{"kind":"arxiv","id":"1301.5769","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.5769","created_at":"2026-05-18T02:48:27.475956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5769v1","created_at":"2026-05-18T02:48:27.475956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5769","created_at":"2026-05-18T02:48:27.475956+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4WUKMLXMF5S","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4WUKMLXMF5SXJZD","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4WUKMLX","created_at":"2026-05-18T12:27:59.945178+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/T4WUKMLXMF5SXJZDKLXAY7ZOFU","json":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU.json","graph_json":"https://pith.science/api/pith-number/T4WUKMLXMF5SXJZDKLXAY7ZOFU/graph.json","events_json":"https://pith.science/api/pith-number/T4WUKMLXMF5SXJZDKLXAY7ZOFU/events.json","paper":"https://pith.science/paper/T4WUKMLX"},"agent_actions":{"view_html":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU","download_json":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU.json","view_paper":"https://pith.science/paper/T4WUKMLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5769&json=true","fetch_graph":"https://pith.science/api/pith-number/T4WUKMLXMF5SXJZDKLXAY7ZOFU/graph.json","fetch_events":"https://pith.science/api/pith-number/T4WUKMLXMF5SXJZDKLXAY7ZOFU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/action/storage_attestation","attest_author":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/action/author_attestation","sign_citation":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/action/citation_signature","submit_replication":"https://pith.science/pith/T4WUKMLXMF5SXJZDKLXAY7ZOFU/action/replication_record"}},"created_at":"2026-05-18T02:48:27.475956+00:00","updated_at":"2026-05-18T02:48:27.475956+00:00"}