{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TV4LQZERZHF74LNNQCSCVNU4QZ","short_pith_number":"pith:TV4LQZER","schema_version":"1.0","canonical_sha256":"9d78b86491c9cbfe2dad80a42ab69c865a6cb62e4dff6b687e115f88aa7c9471","source":{"kind":"arxiv","id":"1310.5634","version":2},"attestation_state":"computed","paper":{"title":"Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. Markstrom, M. Aaghabali, S. Akbari, S. Friedland, Z. Tajfirouz","submitted_at":"2013-10-21T16:37:21Z","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."},"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":"1310.5634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-21T16:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"0fff94b5b8957f05679e43fa127ecdf9c60b9d3286c21530de8a080334874c9c","abstract_canon_sha256":"0398f4a955fce43bdef009000f8b77b68b2894b760b5164a5cb62f41b90bbda1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:13.041980Z","signature_b64":"X6OiPUNQKIC4mzXW9yvaJZ1hZeCX/B+xLu3f9Eju8goVZkCParyQRGbukE0sFyBkuEozTpgahxMUE2vqLsI6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d78b86491c9cbfe2dad80a42ab69c865a6cb62e4dff6b687e115f88aa7c9471","last_reissued_at":"2026-05-18T02:46:13.041336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:13.041336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K. Markstrom, M. Aaghabali, S. Akbari, S. Friedland, Z. Tajfirouz","submitted_at":"2013-10-21T16:37:21Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5634","kind":"arxiv","version":2},"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":"1310.5634","created_at":"2026-05-18T02:46:13.041431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5634v2","created_at":"2026-05-18T02:46:13.041431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5634","created_at":"2026-05-18T02:46:13.041431+00:00"},{"alias_kind":"pith_short_12","alias_value":"TV4LQZERZHF7","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TV4LQZERZHF74LNN","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TV4LQZER","created_at":"2026-05-18T12:28:02.375192+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/TV4LQZERZHF74LNNQCSCVNU4QZ","json":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ.json","graph_json":"https://pith.science/api/pith-number/TV4LQZERZHF74LNNQCSCVNU4QZ/graph.json","events_json":"https://pith.science/api/pith-number/TV4LQZERZHF74LNNQCSCVNU4QZ/events.json","paper":"https://pith.science/paper/TV4LQZER"},"agent_actions":{"view_html":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ","download_json":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ.json","view_paper":"https://pith.science/paper/TV4LQZER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5634&json=true","fetch_graph":"https://pith.science/api/pith-number/TV4LQZERZHF74LNNQCSCVNU4QZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TV4LQZERZHF74LNNQCSCVNU4QZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/action/storage_attestation","attest_author":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/action/author_attestation","sign_citation":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/action/citation_signature","submit_replication":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/action/replication_record"}},"created_at":"2026-05-18T02:46:13.041431+00:00","updated_at":"2026-05-18T02:46:13.041431+00:00"}