{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:376XXADWOTZEZN5ZCUHQ3JYJBN","short_pith_number":"pith:376XXADW","schema_version":"1.0","canonical_sha256":"dffd7b807674f24cb7b9150f0da7090b517ffce00e8acc642f75552b30f6ff0a","source":{"kind":"arxiv","id":"1102.0712","version":2},"attestation_state":"computed","paper":{"title":"Matchings on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles Bordenave, Justin Salez, Marc Lelarge","submitted_at":"2011-02-03T15:53:57Z","abstract_excerpt":"Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting parameter via a local recursion defined directly on the limit of the graph sequence. Interestingly, the recursion may admit multiple solutions, implying non-trivial long-range dependencies between the covered vertices. We overcome this lack of correlation decay by introducing a perturbative parameter (temperature), which we let progressively go to zero. This allows "},"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":"1102.0712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-02-03T15:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"df4220f8eaa3bfc36e5d735dc14f5b1513fea5ac609d0635cfbe471dfba704da","abstract_canon_sha256":"4d74d2b219eac5857e5c2a7a42de32777d612803caf0ed8d34b1d4d10f65ac91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.158132Z","signature_b64":"QlYkEMLjr9QvNm2+3+riQInVYt0QsWc5G77fA0+z6XBxpTb5vQdDsXSKWw3blXUMknCqV6jHnwYQGfu15+1KBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dffd7b807674f24cb7b9150f0da7090b517ffce00e8acc642f75552b30f6ff0a","last_reissued_at":"2026-05-18T03:58:05.157577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.157577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matchings on infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Charles Bordenave, Justin Salez, Marc Lelarge","submitted_at":"2011-02-03T15:53:57Z","abstract_excerpt":"Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting parameter via a local recursion defined directly on the limit of the graph sequence. Interestingly, the recursion may admit multiple solutions, implying non-trivial long-range dependencies between the covered vertices. We overcome this lack of correlation decay by introducing a perturbative parameter (temperature), which we let progressively go to zero. This allows "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0712","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":"1102.0712","created_at":"2026-05-18T03:58:05.157653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0712v2","created_at":"2026-05-18T03:58:05.157653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0712","created_at":"2026-05-18T03:58:05.157653+00:00"},{"alias_kind":"pith_short_12","alias_value":"376XXADWOTZE","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"376XXADWOTZEZN5Z","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"376XXADW","created_at":"2026-05-18T12:26:18.847500+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/376XXADWOTZEZN5ZCUHQ3JYJBN","json":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN.json","graph_json":"https://pith.science/api/pith-number/376XXADWOTZEZN5ZCUHQ3JYJBN/graph.json","events_json":"https://pith.science/api/pith-number/376XXADWOTZEZN5ZCUHQ3JYJBN/events.json","paper":"https://pith.science/paper/376XXADW"},"agent_actions":{"view_html":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN","download_json":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN.json","view_paper":"https://pith.science/paper/376XXADW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0712&json=true","fetch_graph":"https://pith.science/api/pith-number/376XXADWOTZEZN5ZCUHQ3JYJBN/graph.json","fetch_events":"https://pith.science/api/pith-number/376XXADWOTZEZN5ZCUHQ3JYJBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN/action/storage_attestation","attest_author":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN/action/author_attestation","sign_citation":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN/action/citation_signature","submit_replication":"https://pith.science/pith/376XXADWOTZEZN5ZCUHQ3JYJBN/action/replication_record"}},"created_at":"2026-05-18T03:58:05.157653+00:00","updated_at":"2026-05-18T03:58:05.157653+00:00"}