{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:K7CSKFJDYYTHMCPN33KBCR5MFI","short_pith_number":"pith:K7CSKFJD","schema_version":"1.0","canonical_sha256":"57c5251523c6267609edded41147ac2a1f11ea1de996cca5964d22492abc96f0","source":{"kind":"arxiv","id":"cond-mat/0211403","version":2},"attestation_state":"computed","paper":{"title":"Vertex-cover in random graphs with small connectivity: an exact solution","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"E. Caglioti","submitted_at":"2002-11-19T10:44:36Z","abstract_excerpt":"This paper has been withdrawn by the author, due to the fact that the main result in it has already been obtained in [1] for any c < e, see also [2] and [3].\n Moreover the formula which gives the minimal vertex-cover in a tree\n (see the abstract) has already been derived in [4]. I thank M. Bauer, O. Golinelli, F. Ricci-Tersenghi, G. Semerjian and M. Weigt for having brought to my attention [1] and M.B. and O.G. for [4].\n  [1] M. Bauer and O. Golinelli, Eur. Phys. J. B 24, 339-352 (2001);\n  [2] R. M. Karp and M. Sipser, Proc. 22nd IEEE Symposium on Foundations of Computing,(1981), 364-375;\n  [3"},"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":"cond-mat/0211403","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cond-mat.stat-mech","submitted_at":"2002-11-19T10:44:36Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"7baf04a6422145a88b3adc54f6f5322ae728248077252881582f5d290e7e793b","abstract_canon_sha256":"6cda1bc866be43efe7364280bc009cec9211e764f645144aa74027e59b1bc1bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:58.510130Z","signature_b64":"qeVd1uGn6ntjxZh3e29ovgA6nubDCo+l4gQzu20J4M5WsTNkRJI09eG4/4XnxSdGizVudnQNvizNuEFV3KFZCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c5251523c6267609edded41147ac2a1f11ea1de996cca5964d22492abc96f0","last_reissued_at":"2026-05-18T01:06:58.509697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:58.509697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-cover in random graphs with small connectivity: an exact solution","license":"","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"cond-mat.stat-mech","authors_text":"E. Caglioti","submitted_at":"2002-11-19T10:44:36Z","abstract_excerpt":"This paper has been withdrawn by the author, due to the fact that the main result in it has already been obtained in [1] for any c < e, see also [2] and [3].\n Moreover the formula which gives the minimal vertex-cover in a tree\n (see the abstract) has already been derived in [4]. I thank M. Bauer, O. Golinelli, F. Ricci-Tersenghi, G. Semerjian and M. Weigt for having brought to my attention [1] and M.B. and O.G. for [4].\n  [1] M. Bauer and O. Golinelli, Eur. Phys. J. B 24, 339-352 (2001);\n  [2] R. M. Karp and M. Sipser, Proc. 22nd IEEE Symposium on Foundations of Computing,(1981), 364-375;\n  [3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0211403","kind":"arxiv","version":2},"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":"cond-mat/0211403","created_at":"2026-05-18T01:06:58.509762+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0211403v2","created_at":"2026-05-18T01:06:58.509762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0211403","created_at":"2026-05-18T01:06:58.509762+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7CSKFJDYYTH","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7CSKFJDYYTHMCPN","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7CSKFJD","created_at":"2026-05-18T12:25:51.375804+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/K7CSKFJDYYTHMCPN33KBCR5MFI","json":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI.json","graph_json":"https://pith.science/api/pith-number/K7CSKFJDYYTHMCPN33KBCR5MFI/graph.json","events_json":"https://pith.science/api/pith-number/K7CSKFJDYYTHMCPN33KBCR5MFI/events.json","paper":"https://pith.science/paper/K7CSKFJD"},"agent_actions":{"view_html":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI","download_json":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI.json","view_paper":"https://pith.science/paper/K7CSKFJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0211403&json=true","fetch_graph":"https://pith.science/api/pith-number/K7CSKFJDYYTHMCPN33KBCR5MFI/graph.json","fetch_events":"https://pith.science/api/pith-number/K7CSKFJDYYTHMCPN33KBCR5MFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI/action/storage_attestation","attest_author":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI/action/author_attestation","sign_citation":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI/action/citation_signature","submit_replication":"https://pith.science/pith/K7CSKFJDYYTHMCPN33KBCR5MFI/action/replication_record"}},"created_at":"2026-05-18T01:06:58.509762+00:00","updated_at":"2026-05-18T01:06:58.509762+00:00"}