{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VIG4GUH6RID6EAEJD6IYM6DF52","short_pith_number":"pith:VIG4GUH6","canonical_record":{"source":{"id":"1310.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-07T18:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"2e13b7b79b9f961892108443d6fee8f1e9bb515955ae23293a13615b20f27ae6","abstract_canon_sha256":"bd36c59e5f94c0ddfff84ac374f5b5a4b9d77335e32c4bb1598c449d2a0797ae"},"schema_version":"1.0"},"canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","source":{"kind":"arxiv","id":"1310.1879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1879","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1879v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1879","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"VIG4GUH6RID6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VIG4GUH6RID6EAEJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VIG4GUH6","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VIG4GUH6RID6EAEJD6IYM6DF52","target":"record","payload":{"canonical_record":{"source":{"id":"1310.1879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-07T18:24:22Z","cross_cats_sorted":[],"title_canon_sha256":"2e13b7b79b9f961892108443d6fee8f1e9bb515955ae23293a13615b20f27ae6","abstract_canon_sha256":"bd36c59e5f94c0ddfff84ac374f5b5a4b9d77335e32c4bb1598c449d2a0797ae"},"schema_version":"1.0"},"canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.287327Z","signature_b64":"mhyHTRnDBz7c/fEnvMfCRYSuYVx+2MrJPU8NNQAYqlHMKZJfXwo0w0ZH8dixLxIwMGtNYuQmvjycryTqafMnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","last_reissued_at":"2026-05-18T03:11:10.286593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.286593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.1879","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:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsIjj0D8KCNDDdwQD29Sl/wEiL4+P2G6ysOk443Wk9so5loAHHRndDC1UPVRKG4oyEc/b9swIi3fHVPHQIV5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:30.354250Z"},"content_sha256":"e21c633c0e2479ca1c7804d1b3d4da4b1ef4aeba32281109feabcb8109cc3ca1","schema_version":"1.0","event_id":"sha256:e21c633c0e2479ca1c7804d1b3d4da4b1ef4aeba32281109feabcb8109cc3ca1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VIG4GUH6RID6EAEJD6IYM6DF52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs with the Fewest Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A.J. Radcliffe, L. Keough","submitted_at":"2013-10-07T18:24:22Z","abstract_excerpt":"In recent years there has been increased interest in extremal problems for \"counting\" parameters of graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. In the same spirit, the Upper Matching Conjecture claims an upper bound on the number of $k$-matchings in a $d$-regular graph. Here we consider both matchings and matchings of fixed sizes in graphs with a given number vertices and edges. We prove that the graph with the fewest matchings is either the lex or the colex graph. Similarly, for fixed $k$, the graph with the fewest "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1879","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:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zc57TZrJ0qCyWr3BDZiZj5QctAz5DqUo5N5lnM9sUTqSpFWXL507l35FPH9ctRl6oXevmWOYLldaeIoLwdPyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:30.354610Z"},"content_sha256":"250e710530ca5ae278cf84a89329904ffe6decb77308c4eb4fb9415982202603","schema_version":"1.0","event_id":"sha256:250e710530ca5ae278cf84a89329904ffe6decb77308c4eb4fb9415982202603"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/bundle.json","state_url":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIG4GUH6RID6EAEJD6IYM6DF52/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-02T16:53:30Z","links":{"resolver":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52","bundle":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/bundle.json","state":"https://pith.science/pith/VIG4GUH6RID6EAEJD6IYM6DF52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIG4GUH6RID6EAEJD6IYM6DF52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VIG4GUH6RID6EAEJD6IYM6DF52","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":"bd36c59e5f94c0ddfff84ac374f5b5a4b9d77335e32c4bb1598c449d2a0797ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-07T18:24:22Z","title_canon_sha256":"2e13b7b79b9f961892108443d6fee8f1e9bb515955ae23293a13615b20f27ae6"},"schema_version":"1.0","source":{"id":"1310.1879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1879","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1879v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1879","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"VIG4GUH6RID6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VIG4GUH6RID6EAEJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VIG4GUH6","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:250e710530ca5ae278cf84a89329904ffe6decb77308c4eb4fb9415982202603","target":"graph","created_at":"2026-05-18T03:11:10Z","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":"In recent years there has been increased interest in extremal problems for \"counting\" parameters of graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. In the same spirit, the Upper Matching Conjecture claims an upper bound on the number of $k$-matchings in a $d$-regular graph. Here we consider both matchings and matchings of fixed sizes in graphs with a given number vertices and edges. We prove that the graph with the fewest matchings is either the lex or the colex graph. Similarly, for fixed $k$, the graph with the fewest ","authors_text":"A.J. Radcliffe, L. Keough","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-07T18:24:22Z","title":"Graphs with the Fewest Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1879","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:e21c633c0e2479ca1c7804d1b3d4da4b1ef4aeba32281109feabcb8109cc3ca1","target":"record","created_at":"2026-05-18T03:11:10Z","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":"bd36c59e5f94c0ddfff84ac374f5b5a4b9d77335e32c4bb1598c449d2a0797ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-07T18:24:22Z","title_canon_sha256":"2e13b7b79b9f961892108443d6fee8f1e9bb515955ae23293a13615b20f27ae6"},"schema_version":"1.0","source":{"id":"1310.1879","kind":"arxiv","version":1}},"canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa0dc350fe8a07e200891f91867865ee9979bd9082a6431de348490511934d00","first_computed_at":"2026-05-18T03:11:10.286593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.286593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mhyHTRnDBz7c/fEnvMfCRYSuYVx+2MrJPU8NNQAYqlHMKZJfXwo0w0ZH8dixLxIwMGtNYuQmvjycryTqafMnCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.287327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e21c633c0e2479ca1c7804d1b3d4da4b1ef4aeba32281109feabcb8109cc3ca1","sha256:250e710530ca5ae278cf84a89329904ffe6decb77308c4eb4fb9415982202603"],"state_sha256":"a053fcc883cb9ef9644f583437be7b0bcf4f1955894426ffead026a093ebf17c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wkmAjdms/xwnPlBpzTotLHnMpjfO5dAl+FSRVtaRaKJeEqt1Pi0DaEn1wqEhALkhV/ENaGoIXvrQdP8H/UvBCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:53:30.356416Z","bundle_sha256":"9d76ac40e1ff008060ca9f17bf559c64fb3ad1bbb44827c74ee2feda6ec7e4fb"}}