{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B3467CJTX34NAXDVAVEJWL6Q64","short_pith_number":"pith:B3467CJT","schema_version":"1.0","canonical_sha256":"0ef9ef8933bef8d05c7505489b2fd0f711c1d4bcd1b5e47241ae7a5308962ec8","source":{"kind":"arxiv","id":"1208.3629","version":5},"attestation_state":"computed","paper":{"title":"Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Hang Zhou, Marc Lelarge","submitted_at":"2012-08-17T16:11:27Z","abstract_excerpt":"For a graph $G$, let $Z(G,\\lambda)$ be the partition function of the monomer-dimer system defined by $\\sum_k m_k(G)\\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a sublinear-time algorithm for estimating $\\log Z(G,\\lambda)$ at an arbitrary value $\\lambda>0$ within additive error $\\epsilon n$ with high probability. The query complexity of our algorithm does not depend on the size of $G$ and is polynomial in $1/\\epsilon$, and we also provide a lower bound quadratic in $1/\\epsilon$ for this problem. This is the first anal"},"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":"1208.3629","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-17T16:11:27Z","cross_cats_sorted":["cs.DM","math.PR"],"title_canon_sha256":"9167a36ce0a020bb1c1ab1f1377352c6953d56e305ef57cffcc9858508617a7c","abstract_canon_sha256":"b3b12a79af69f4fe8769721e8d7fea387ecbf8a8c7f634d5799308824b429e0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:17.540659Z","signature_b64":"LFuox6VlaGfyY2xUfqCYgwQPTU8j4G9RSug0WqUvN66aodt1hWbV38KzhpaJy6iEjIs0T9r4v/36Fc7gvSK+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ef9ef8933bef8d05c7505489b2fd0f711c1d4bcd1b5e47241ae7a5308962ec8","last_reissued_at":"2026-05-18T03:14:17.540087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:17.540087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.PR"],"primary_cat":"cs.DS","authors_text":"Hang Zhou, Marc Lelarge","submitted_at":"2012-08-17T16:11:27Z","abstract_excerpt":"For a graph $G$, let $Z(G,\\lambda)$ be the partition function of the monomer-dimer system defined by $\\sum_k m_k(G)\\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a sublinear-time algorithm for estimating $\\log Z(G,\\lambda)$ at an arbitrary value $\\lambda>0$ within additive error $\\epsilon n$ with high probability. The query complexity of our algorithm does not depend on the size of $G$ and is polynomial in $1/\\epsilon$, and we also provide a lower bound quadratic in $1/\\epsilon$ for this problem. This is the first anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.3629","kind":"arxiv","version":5},"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":"1208.3629","created_at":"2026-05-18T03:14:17.540179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.3629v5","created_at":"2026-05-18T03:14:17.540179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.3629","created_at":"2026-05-18T03:14:17.540179+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3467CJTX34N","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3467CJTX34NAXDV","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3467CJT","created_at":"2026-05-18T12:26:58.693483+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/B3467CJTX34NAXDVAVEJWL6Q64","json":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64.json","graph_json":"https://pith.science/api/pith-number/B3467CJTX34NAXDVAVEJWL6Q64/graph.json","events_json":"https://pith.science/api/pith-number/B3467CJTX34NAXDVAVEJWL6Q64/events.json","paper":"https://pith.science/paper/B3467CJT"},"agent_actions":{"view_html":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64","download_json":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64.json","view_paper":"https://pith.science/paper/B3467CJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.3629&json=true","fetch_graph":"https://pith.science/api/pith-number/B3467CJTX34NAXDVAVEJWL6Q64/graph.json","fetch_events":"https://pith.science/api/pith-number/B3467CJTX34NAXDVAVEJWL6Q64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64/action/storage_attestation","attest_author":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64/action/author_attestation","sign_citation":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64/action/citation_signature","submit_replication":"https://pith.science/pith/B3467CJTX34NAXDVAVEJWL6Q64/action/replication_record"}},"created_at":"2026-05-18T03:14:17.540179+00:00","updated_at":"2026-05-18T03:14:17.540179+00:00"}