{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H7E6ZTM2DONY2YM5WOFIPYGCMP","short_pith_number":"pith:H7E6ZTM2","schema_version":"1.0","canonical_sha256":"3fc9eccd9a1b9b8d619db38a87e0c263f044f178de2d819a60632d5f1a596e9e","source":{"kind":"arxiv","id":"1802.02997","version":2},"attestation_state":"computed","paper":{"title":"The Random Fractional Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Carlo Lucibello, Enrico M. Malatesta, Gabriele Sicuro, Giorgio Parisi","submitted_at":"2018-02-08T18:26:09Z","abstract_excerpt":"We consider two formulations of the random-link fractional matching problem, a relaxed version of the more standard random-link (integer) matching problem. In one formulation, we allow each node to be linked to itself in the optimal matching configuration. In the other one, on the contrary, such a link is forbidden. Both problems have the same asymptotic average optimal cost of the random-link matching problem on the complete graph. Using a replica approach and previous results of W\\\"{a}stlund [Acta Mathematica 204, 91-150 (2010)], we analytically derive the finite-size corrections to the asym"},"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":"1802.02997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-08T18:26:09Z","cross_cats_sorted":[],"title_canon_sha256":"a1752e67618c15cbaf40f3929f801837089feea0b643a97fb28111fc4872fcf7","abstract_canon_sha256":"363503393614637963b0608d7541e1f6c8503d7ea502a22647d2c0e8655bd715"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:50.173490Z","signature_b64":"EI3lAf9v82bYmLk8+g0MU+MekFjDhu9dXjvjbQNp/jv1rMxiP2j9qVAwGagBVnsvy0e5iNkl7RppCVrDrQEhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fc9eccd9a1b9b8d619db38a87e0c263f044f178de2d819a60632d5f1a596e9e","last_reissued_at":"2026-05-18T00:16:50.172792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:50.172792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Random Fractional Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Carlo Lucibello, Enrico M. Malatesta, Gabriele Sicuro, Giorgio Parisi","submitted_at":"2018-02-08T18:26:09Z","abstract_excerpt":"We consider two formulations of the random-link fractional matching problem, a relaxed version of the more standard random-link (integer) matching problem. In one formulation, we allow each node to be linked to itself in the optimal matching configuration. In the other one, on the contrary, such a link is forbidden. Both problems have the same asymptotic average optimal cost of the random-link matching problem on the complete graph. Using a replica approach and previous results of W\\\"{a}stlund [Acta Mathematica 204, 91-150 (2010)], we analytically derive the finite-size corrections to the asym"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02997","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":"1802.02997","created_at":"2026-05-18T00:16:50.172896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02997v2","created_at":"2026-05-18T00:16:50.172896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02997","created_at":"2026-05-18T00:16:50.172896+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7E6ZTM2DONY","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7E6ZTM2DONY2YM5","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7E6ZTM2","created_at":"2026-05-18T12:32:28.185984+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/H7E6ZTM2DONY2YM5WOFIPYGCMP","json":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP.json","graph_json":"https://pith.science/api/pith-number/H7E6ZTM2DONY2YM5WOFIPYGCMP/graph.json","events_json":"https://pith.science/api/pith-number/H7E6ZTM2DONY2YM5WOFIPYGCMP/events.json","paper":"https://pith.science/paper/H7E6ZTM2"},"agent_actions":{"view_html":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP","download_json":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP.json","view_paper":"https://pith.science/paper/H7E6ZTM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02997&json=true","fetch_graph":"https://pith.science/api/pith-number/H7E6ZTM2DONY2YM5WOFIPYGCMP/graph.json","fetch_events":"https://pith.science/api/pith-number/H7E6ZTM2DONY2YM5WOFIPYGCMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/action/storage_attestation","attest_author":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/action/author_attestation","sign_citation":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/action/citation_signature","submit_replication":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/action/replication_record"}},"created_at":"2026-05-18T00:16:50.172896+00:00","updated_at":"2026-05-18T00:16:50.172896+00:00"}