{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:H7E6ZTM2DONY2YM5WOFIPYGCMP","short_pith_number":"pith:H7E6ZTM2","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"},"canonical_sha256":"3fc9eccd9a1b9b8d619db38a87e0c263f044f178de2d819a60632d5f1a596e9e","source":{"kind":"arxiv","id":"1802.02997","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02997","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02997v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02997","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"H7E6ZTM2DONY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7E6ZTM2DONY2YM5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7E6ZTM2","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:H7E6ZTM2DONY2YM5WOFIPYGCMP","target":"record","payload":{"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"},"canonical_sha256":"3fc9eccd9a1b9b8d619db38a87e0c263f044f178de2d819a60632d5f1a596e9e","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"},"source_kind":"arxiv","source_id":"1802.02997","source_version":2,"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-18T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIL106jpQcO8RNGK6ypOBkYfYrMxbmI9hnWdN5l0AKQmi90Dl2sPj0SgconW9PhgqsIknSuIgiQ87zhbk/EOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:37:16.719137Z"},"content_sha256":"ae1a32960bb943fd4facfd935b34af1c0a45120d5026c5f79103fe7afafbf3a1","schema_version":"1.0","event_id":"sha256:ae1a32960bb943fd4facfd935b34af1c0a45120d5026c5f79103fe7afafbf3a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:H7E6ZTM2DONY2YM5WOFIPYGCMP","target":"graph","payload":{"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"},"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-18T00:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bU0Qw1Nk2k+zbA2/GOXkRZ0VCkdO0g7tPMNzqjixhuyXi2P6vGKNBP8k3MS7lGo1PlsI6KVQQZZ7470Vzo3PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:37:16.719502Z"},"content_sha256":"1962feeaac8d7bced17ba13ec985f8c9997be50578542b2a879b3c1d3116b3f8","schema_version":"1.0","event_id":"sha256:1962feeaac8d7bced17ba13ec985f8c9997be50578542b2a879b3c1d3116b3f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/bundle.json","state_url":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/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-11T09:37:16Z","links":{"resolver":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP","bundle":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/bundle.json","state":"https://pith.science/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7E6ZTM2DONY2YM5WOFIPYGCMP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:H7E6ZTM2DONY2YM5WOFIPYGCMP","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":"363503393614637963b0608d7541e1f6c8503d7ea502a22647d2c0e8655bd715","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-08T18:26:09Z","title_canon_sha256":"a1752e67618c15cbaf40f3929f801837089feea0b643a97fb28111fc4872fcf7"},"schema_version":"1.0","source":{"id":"1802.02997","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02997","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02997v2","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02997","created_at":"2026-05-18T00:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"H7E6ZTM2DONY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"H7E6ZTM2DONY2YM5","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"H7E6ZTM2","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:1962feeaac8d7bced17ba13ec985f8c9997be50578542b2a879b3c1d3116b3f8","target":"graph","created_at":"2026-05-18T00:16:50Z","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 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","authors_text":"Carlo Lucibello, Enrico M. Malatesta, Gabriele Sicuro, Giorgio Parisi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-08T18:26:09Z","title":"The Random Fractional Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02997","kind":"arxiv","version":2},"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:ae1a32960bb943fd4facfd935b34af1c0a45120d5026c5f79103fe7afafbf3a1","target":"record","created_at":"2026-05-18T00:16:50Z","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":"363503393614637963b0608d7541e1f6c8503d7ea502a22647d2c0e8655bd715","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-02-08T18:26:09Z","title_canon_sha256":"a1752e67618c15cbaf40f3929f801837089feea0b643a97fb28111fc4872fcf7"},"schema_version":"1.0","source":{"id":"1802.02997","kind":"arxiv","version":2}},"canonical_sha256":"3fc9eccd9a1b9b8d619db38a87e0c263f044f178de2d819a60632d5f1a596e9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fc9eccd9a1b9b8d619db38a87e0c263f044f178de2d819a60632d5f1a596e9e","first_computed_at":"2026-05-18T00:16:50.172792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:50.172792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EI3lAf9v82bYmLk8+g0MU+MekFjDhu9dXjvjbQNp/jv1rMxiP2j9qVAwGagBVnsvy0e5iNkl7RppCVrDrQEhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:50.173490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02997","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae1a32960bb943fd4facfd935b34af1c0a45120d5026c5f79103fe7afafbf3a1","sha256:1962feeaac8d7bced17ba13ec985f8c9997be50578542b2a879b3c1d3116b3f8"],"state_sha256":"3c4a42e744cf1113f8bd925fc0601c5dbe4f3820fae133af3d3c3f764248225f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABe0wKsb+Eb7lgrzD8PRFtqY3ndl3XFyNsUNHwKQMfna5d0DdMWfzUkX2A+3Pf699fC99Zy1qyWLCg+1GE0WBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:37:16.721672Z","bundle_sha256":"75e1335ae8446a53bb54b75508955907854273438fa80d515aa88c9826b16f9c"}}