{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:BTC7QOWNRHPPGMAUK4SN3G77AM","short_pith_number":"pith:BTC7QOWN","schema_version":"1.0","canonical_sha256":"0cc5f83acd89def330145724dd9bff0321cde3b211fbfdeadb1c4d023f9062a4","source":{"kind":"arxiv","id":"cond-mat/0309348","version":1},"attestation_state":"computed","paper":{"title":"Maximum matching on random graphs","license":"","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Haijun Zhou, Zhong-Can Ou-Yang","submitted_at":"2003-09-15T12:53:54Z","abstract_excerpt":"The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \\mth{c} is larger than \\mth{2.7183}, groups of max-matching patterns which differ greatly from each other {\\em gradually} emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on this {\\em continuous} glassy phase transition and the absence of such a glassy phase in the related minimum vertex covering problem."},"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/0309348","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"2003-09-15T12:53:54Z","cross_cats_sorted":["cond-mat.stat-mech"],"title_canon_sha256":"35b58385d4c2ef67574ba042ec38dff9e5bb8a71ee3a29bde19096cecae34b59","abstract_canon_sha256":"3e02b89d026baf6249a41cb6d1e890953c012087b0c61f7b9f01ee520977db21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:20:23.676644Z","signature_b64":"vZH/J3lEdlLzb+Hbed5gaOOTzDbFqHFcoquu6OhYDNNCX7IsfpRWTwa6/qpy+5yrWBtP/YewZBaZs7vnNjKkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc5f83acd89def330145724dd9bff0321cde3b211fbfdeadb1c4d023f9062a4","last_reissued_at":"2026-07-04T14:20:23.676229Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:20:23.676229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum matching on random graphs","license":"","headline":"","cross_cats":["cond-mat.stat-mech"],"primary_cat":"cond-mat.dis-nn","authors_text":"Haijun Zhou, Zhong-Can Ou-Yang","submitted_at":"2003-09-15T12:53:54Z","abstract_excerpt":"The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \\mth{c} is larger than \\mth{2.7183}, groups of max-matching patterns which differ greatly from each other {\\em gradually} emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on this {\\em continuous} glassy phase transition and the absence of such a glassy phase in the related minimum vertex covering problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0309348","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cond-mat/0309348/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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/0309348","created_at":"2026-07-04T14:20:23.676288+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0309348v1","created_at":"2026-07-04T14:20:23.676288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0309348","created_at":"2026-07-04T14:20:23.676288+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTC7QOWNRHPP","created_at":"2026-07-04T14:20:23.676288+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTC7QOWNRHPPGMAU","created_at":"2026-07-04T14:20:23.676288+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTC7QOWN","created_at":"2026-07-04T14:20:23.676288+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.01288","citing_title":"Irrelevance of linear controllability to nonlinear dynamical networks","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM","json":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM.json","graph_json":"https://pith.science/api/pith-number/BTC7QOWNRHPPGMAUK4SN3G77AM/graph.json","events_json":"https://pith.science/api/pith-number/BTC7QOWNRHPPGMAUK4SN3G77AM/events.json","paper":"https://pith.science/paper/BTC7QOWN"},"agent_actions":{"view_html":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM","download_json":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM.json","view_paper":"https://pith.science/paper/BTC7QOWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/0309348&json=true","fetch_graph":"https://pith.science/api/pith-number/BTC7QOWNRHPPGMAUK4SN3G77AM/graph.json","fetch_events":"https://pith.science/api/pith-number/BTC7QOWNRHPPGMAUK4SN3G77AM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM/action/storage_attestation","attest_author":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM/action/author_attestation","sign_citation":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM/action/citation_signature","submit_replication":"https://pith.science/pith/BTC7QOWNRHPPGMAUK4SN3G77AM/action/replication_record"}},"created_at":"2026-07-04T14:20:23.676288+00:00","updated_at":"2026-07-04T14:20:23.676288+00:00"}