{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TV4LQZERZHF74LNNQCSCVNU4QZ","short_pith_number":"pith:TV4LQZER","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"},"canonical_sha256":"9d78b86491c9cbfe2dad80a42ab69c865a6cb62e4dff6b687e115f88aa7c9471","source":{"kind":"arxiv","id":"1310.5634","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TV4LQZERZHF74LNNQCSCVNU4QZ","target":"record","payload":{"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"},"canonical_sha256":"9d78b86491c9cbfe2dad80a42ab69c865a6cb62e4dff6b687e115f88aa7c9471","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"},"source_kind":"arxiv","source_id":"1310.5634","source_version":2,"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-18T02:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nVN2Bb5N3R4rg4XHFCmtcpwvibRMSQXO8czfOFgWuMu9e0YM7D0dvcWydytYfjpsuW0fwWFKyak+OIrZTaZnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:15:32.940724Z"},"content_sha256":"8a38b6a7f657b4fe04fb21f90b6b77e4fd618b21406504add6c29ee8ff8c3798","schema_version":"1.0","event_id":"sha256:8a38b6a7f657b4fe04fb21f90b6b77e4fd618b21406504add6c29ee8ff8c3798"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TV4LQZERZHF74LNNQCSCVNU4QZ","target":"graph","payload":{"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"},"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-18T02:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzggA5sJglXcQg9lx2u1DNWtOH2cCPo6ldf8rNE/X1aEqncZcLBSvfBNBwU+hcWHVkQR0DKlKeRCRorArnRuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:15:32.941069Z"},"content_sha256":"a7176ceb61e6120dc62a543f6615ad761c5006b35cfacf919cf3007465e3a1aa","schema_version":"1.0","event_id":"sha256:a7176ceb61e6120dc62a543f6615ad761c5006b35cfacf919cf3007465e3a1aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/bundle.json","state_url":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/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-02T07:15:32Z","links":{"resolver":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ","bundle":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/bundle.json","state":"https://pith.science/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TV4LQZERZHF74LNNQCSCVNU4QZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKgsYlxAz4zc9uVaPVPjYRHf7p0PdbQsJsW6KFYs2sKeJn+rYPurWPTLfpRG96qBCop8sgIfJsX/v7yJoG4ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:15:32.943044Z","bundle_sha256":"b4395089655afd3bc34633c70b08bb20f4b489600f169b33bf51c6f2d5a10237"}}