{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NWCOMFMTIZHUTXV3EEAH2HJH5M","short_pith_number":"pith:NWCOMFMT","schema_version":"1.0","canonical_sha256":"6d84e61593464f49debb21007d1d27eb25cdf238464b92862dc1d2ec15b7754d","source":{"kind":"arxiv","id":"1206.3211","version":1},"attestation_state":"computed","paper":{"title":"Matchings and Independent Sets of a Fixed Size in Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, Prasad Tetali, Teena Carroll","submitted_at":"2012-06-14T18:57:04Z","abstract_excerpt":"We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\\ell$ in a $d$-regular graph on $N$ vertices. For $\\frac{2\\ell}{N}$ bounded away from 0 and 1, the logarithm of the bound we obtain agrees in its leading term with the logarithm of the number of matchings of size $\\ell$ in the graph consisting of $\\frac{N}{2d}$ disjoint copies of the complete bipartite graph $K_{d,d}$. This provides asymptotic evidence for a conjecture of S. Friedland {\\it et al.}.\n  We also obtain an analogous result for independent sets of a fixed si"},"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":"1206.3211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T18:57:04Z","cross_cats_sorted":[],"title_canon_sha256":"762eaf09238586a1bba83388cd2cbd5af8083b49f0eef244d816a284c98c5c3a","abstract_canon_sha256":"3adce26168099cc0642dcc49061b38131362daf52dc580b89193dfe1babed823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:32.213466Z","signature_b64":"jXmcsUIkFuWdBv+efZrnXC8b3VxEU+sNJF0tWBd1Vtp3At/OhibGMjksT4DZNsAt/T0tfVafZ5yutrWiV+TDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d84e61593464f49debb21007d1d27eb25cdf238464b92862dc1d2ec15b7754d","last_reissued_at":"2026-05-18T03:53:32.212743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:32.212743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matchings and Independent Sets of a Fixed Size in Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Galvin, Prasad Tetali, Teena Carroll","submitted_at":"2012-06-14T18:57:04Z","abstract_excerpt":"We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\\ell$ in a $d$-regular graph on $N$ vertices. For $\\frac{2\\ell}{N}$ bounded away from 0 and 1, the logarithm of the bound we obtain agrees in its leading term with the logarithm of the number of matchings of size $\\ell$ in the graph consisting of $\\frac{N}{2d}$ disjoint copies of the complete bipartite graph $K_{d,d}$. This provides asymptotic evidence for a conjecture of S. Friedland {\\it et al.}.\n  We also obtain an analogous result for independent sets of a fixed si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3211","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":""},"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":"1206.3211","created_at":"2026-05-18T03:53:32.212854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3211v1","created_at":"2026-05-18T03:53:32.212854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3211","created_at":"2026-05-18T03:53:32.212854+00:00"},{"alias_kind":"pith_short_12","alias_value":"NWCOMFMTIZHU","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NWCOMFMTIZHUTXV3","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NWCOMFMT","created_at":"2026-05-18T12:27:16.716162+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/NWCOMFMTIZHUTXV3EEAH2HJH5M","json":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M.json","graph_json":"https://pith.science/api/pith-number/NWCOMFMTIZHUTXV3EEAH2HJH5M/graph.json","events_json":"https://pith.science/api/pith-number/NWCOMFMTIZHUTXV3EEAH2HJH5M/events.json","paper":"https://pith.science/paper/NWCOMFMT"},"agent_actions":{"view_html":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M","download_json":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M.json","view_paper":"https://pith.science/paper/NWCOMFMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3211&json=true","fetch_graph":"https://pith.science/api/pith-number/NWCOMFMTIZHUTXV3EEAH2HJH5M/graph.json","fetch_events":"https://pith.science/api/pith-number/NWCOMFMTIZHUTXV3EEAH2HJH5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/action/storage_attestation","attest_author":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/action/author_attestation","sign_citation":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/action/citation_signature","submit_replication":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/action/replication_record"}},"created_at":"2026-05-18T03:53:32.212854+00:00","updated_at":"2026-05-18T03:53:32.212854+00:00"}