{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NWCOMFMTIZHUTXV3EEAH2HJH5M","short_pith_number":"pith:NWCOMFMT","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"},"canonical_sha256":"6d84e61593464f49debb21007d1d27eb25cdf238464b92862dc1d2ec15b7754d","source":{"kind":"arxiv","id":"1206.3211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3211","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3211v1","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3211","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"NWCOMFMTIZHU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NWCOMFMTIZHUTXV3","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NWCOMFMT","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NWCOMFMTIZHUTXV3EEAH2HJH5M","target":"record","payload":{"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"},"canonical_sha256":"6d84e61593464f49debb21007d1d27eb25cdf238464b92862dc1d2ec15b7754d","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"},"source_kind":"arxiv","source_id":"1206.3211","source_version":1,"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-18T03:53:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZOA5oC3KUzLvJCFL9TQII9mKu2BEMePLMBpCgN0EGpPzgn6YmMXvlg4Rb+c3PrQ3kFfCaYIUyKsmUXBHgCKAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:52:18.703960Z"},"content_sha256":"7c39b285cb8c13ba070c593c5d5ba14e960ebfb2d5f5379b1980794a90c0e4f4","schema_version":"1.0","event_id":"sha256:7c39b285cb8c13ba070c593c5d5ba14e960ebfb2d5f5379b1980794a90c0e4f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NWCOMFMTIZHUTXV3EEAH2HJH5M","target":"graph","payload":{"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"},"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-18T03:53:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RxvaBayALRH89L02v3BcBqTFQahSx2haropzqt0+xpTaXSNF3tzeuLY4DcMl3S5QQCpl8+KKWoW3Bn4PhPVsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:52:18.704694Z"},"content_sha256":"cd88054386c1ecf0da98e12c9d321b0a6bca729419cb8592a321b6f1d0269212","schema_version":"1.0","event_id":"sha256:cd88054386c1ecf0da98e12c9d321b0a6bca729419cb8592a321b6f1d0269212"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/bundle.json","state_url":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/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-09T19:52:18Z","links":{"resolver":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M","bundle":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/bundle.json","state":"https://pith.science/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWCOMFMTIZHUTXV3EEAH2HJH5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NWCOMFMTIZHUTXV3EEAH2HJH5M","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":"3adce26168099cc0642dcc49061b38131362daf52dc580b89193dfe1babed823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T18:57:04Z","title_canon_sha256":"762eaf09238586a1bba83388cd2cbd5af8083b49f0eef244d816a284c98c5c3a"},"schema_version":"1.0","source":{"id":"1206.3211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3211","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3211v1","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3211","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"NWCOMFMTIZHU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NWCOMFMTIZHUTXV3","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NWCOMFMT","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:cd88054386c1ecf0da98e12c9d321b0a6bca729419cb8592a321b6f1d0269212","target":"graph","created_at":"2026-05-18T03:53:32Z","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 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","authors_text":"David Galvin, Prasad Tetali, Teena Carroll","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T18:57:04Z","title":"Matchings and Independent Sets of a Fixed Size in Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3211","kind":"arxiv","version":1},"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:7c39b285cb8c13ba070c593c5d5ba14e960ebfb2d5f5379b1980794a90c0e4f4","target":"record","created_at":"2026-05-18T03:53:32Z","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":"3adce26168099cc0642dcc49061b38131362daf52dc580b89193dfe1babed823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-14T18:57:04Z","title_canon_sha256":"762eaf09238586a1bba83388cd2cbd5af8083b49f0eef244d816a284c98c5c3a"},"schema_version":"1.0","source":{"id":"1206.3211","kind":"arxiv","version":1}},"canonical_sha256":"6d84e61593464f49debb21007d1d27eb25cdf238464b92862dc1d2ec15b7754d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d84e61593464f49debb21007d1d27eb25cdf238464b92862dc1d2ec15b7754d","first_computed_at":"2026-05-18T03:53:32.212743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:32.212743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jXmcsUIkFuWdBv+efZrnXC8b3VxEU+sNJF0tWBd1Vtp3At/OhibGMjksT4DZNsAt/T0tfVafZ5yutrWiV+TDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:32.213466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c39b285cb8c13ba070c593c5d5ba14e960ebfb2d5f5379b1980794a90c0e4f4","sha256:cd88054386c1ecf0da98e12c9d321b0a6bca729419cb8592a321b6f1d0269212"],"state_sha256":"a8bd28256afdf331af74aa6181000b54651525642f57500ff1e739eb1c688e59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkxDWX5sp6Dqy5uFyedPJnNGwgXcNH5+ruHbG+8kB4l8qFaCeRZ4Fws/Dd8LkjuMTGlZmIUSGLKrJXgk9/vCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:52:18.708666Z","bundle_sha256":"580bd5f6000e49a323266e0f97158273a1f0bac8c504ad1b0d5379b8152b779a"}}