{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TV4LQZERZHF74LNNQCSCVNU4QZ","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":"0398f4a955fce43bdef009000f8b77b68b2894b760b5164a5cb62f41b90bbda1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-21T16:37:21Z","title_canon_sha256":"0fff94b5b8957f05679e43fa127ecdf9c60b9d3286c21530de8a080334874c9c"},"schema_version":"1.0","source":{"id":"1310.5634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5634","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5634v2","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5634","created_at":"2026-05-18T02:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"TV4LQZERZHF7","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TV4LQZERZHF74LNN","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TV4LQZER","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:a7176ceb61e6120dc62a543f6615ad761c5006b35cfacf919cf3007465e3a1aa","target":"graph","created_at":"2026-05-18T02:46:13Z","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 give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on 2n vertices. The upper bound is sharp for n even. For n odd we state a conjecture on a sharp upper bound.","authors_text":"K. Markstrom, M. Aaghabali, S. Akbari, S. Friedland, Z. Tajfirouz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-21T16:37:21Z","title":"Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5634","kind":"arxiv","version":2},"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:8a38b6a7f657b4fe04fb21f90b6b77e4fd618b21406504add6c29ee8ff8c3798","target":"record","created_at":"2026-05-18T02:46:13Z","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":"0398f4a955fce43bdef009000f8b77b68b2894b760b5164a5cb62f41b90bbda1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-21T16:37:21Z","title_canon_sha256":"0fff94b5b8957f05679e43fa127ecdf9c60b9d3286c21530de8a080334874c9c"},"schema_version":"1.0","source":{"id":"1310.5634","kind":"arxiv","version":2}},"canonical_sha256":"9d78b86491c9cbfe2dad80a42ab69c865a6cb62e4dff6b687e115f88aa7c9471","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d78b86491c9cbfe2dad80a42ab69c865a6cb62e4dff6b687e115f88aa7c9471","first_computed_at":"2026-05-18T02:46:13.041336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:13.041336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X6OiPUNQKIC4mzXW9yvaJZ1hZeCX/B+xLu3f9Eju8goVZkCParyQRGbukE0sFyBkuEozTpgahxMUE2vqLsI6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:13.041980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a38b6a7f657b4fe04fb21f90b6b77e4fd618b21406504add6c29ee8ff8c3798","sha256:a7176ceb61e6120dc62a543f6615ad761c5006b35cfacf919cf3007465e3a1aa"],"state_sha256":"8c910ae09aa03bc64d7a10b217e4f2252ee702b77c9c085c34116df7812b146b"}