{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LPO4SGYDFLJOFHJOPOKS2566ZD","short_pith_number":"pith:LPO4SGYD","canonical_record":{"source":{"id":"1105.1764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T19:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"1debfe9152ae5e408599c76b94b59092533c4d23a46f53c6d3febb80c5865f30","abstract_canon_sha256":"f9f9653a9cc537489435ee005eb8b8a03669fcf1ff34bcb6244c321b86cebf0f"},"schema_version":"1.0"},"canonical_sha256":"5bddc91b032ad2e29d2e7b952d77dec8f7f23788051ae37e4416ec7ce302aa8f","source":{"kind":"arxiv","id":"1105.1764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1764","created_at":"2026-05-18T04:22:32Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1764v1","created_at":"2026-05-18T04:22:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1764","created_at":"2026-05-18T04:22:32Z"},{"alias_kind":"pith_short_12","alias_value":"LPO4SGYDFLJO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LPO4SGYDFLJOFHJO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LPO4SGYD","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LPO4SGYDFLJOFHJOPOKS2566ZD","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T19:50:24Z","cross_cats_sorted":[],"title_canon_sha256":"1debfe9152ae5e408599c76b94b59092533c4d23a46f53c6d3febb80c5865f30","abstract_canon_sha256":"f9f9653a9cc537489435ee005eb8b8a03669fcf1ff34bcb6244c321b86cebf0f"},"schema_version":"1.0"},"canonical_sha256":"5bddc91b032ad2e29d2e7b952d77dec8f7f23788051ae37e4416ec7ce302aa8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:32.537201Z","signature_b64":"4KumhZZ9MCRJf6PSQhppFeBrrmkRr6Cv2DQ0JOff2U/AAMeObxMCnmG32Mt3I9Yp9Uw0XHnz/lOQrUFOB/VYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bddc91b032ad2e29d2e7b952d77dec8f7f23788051ae37e4416ec7ce302aa8f","last_reissued_at":"2026-05-18T04:22:32.536632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:32.536632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1764","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-18T04:22:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sbW3DRXMOJzsPj9OQ5H6awuo1XgDxx+7qWTeAEkUeNOHoSgTCNlhkD/aoJHWIQcd4bmLtEENicMGErRq6dcnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:32.451479Z"},"content_sha256":"e73e4786bac5fcf5e0bd2930ab710236b9771c549f0a0fb86c7a60a72af5429f","schema_version":"1.0","event_id":"sha256:e73e4786bac5fcf5e0bd2930ab710236b9771c549f0a0fb86c7a60a72af5429f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LPO4SGYDFLJOFHJOPOKS2566ZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating p-extremal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Derrick Stolee","submitted_at":"2011-05-09T19:50:24Z","abstract_excerpt":"Define f(n,p) to be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved there exist constants n_p and c_p so that for even n >= n_p, f(n,p) = (n^2)/4+c_p. A graph is p-extremal if it has p perfect matchings and (n^2)/4+c_p edges. Based on Lovasz's Two Ear Theorem and structural results of Hartke, Stolee, West, and Yancey, we develop a computational method for determining c_p and generating the finite set of graphs which describe the infinite family of p-extremal graphs. This method extends the knowledge of the size and structure of p-extremal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1764","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-18T04:22:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36BFIYsVs2PHAYagqXageSrXYTfjUB/EB6AMWbQ8eNDEmEj0UJUN8qj9bZJ3STdjGI6IQtxyq9x5rzqx2Fl4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:20:32.451824Z"},"content_sha256":"ce2b200af0477c9732d11d54f78b20c2a34b7a011a686fcba91e50c400e7245e","schema_version":"1.0","event_id":"sha256:ce2b200af0477c9732d11d54f78b20c2a34b7a011a686fcba91e50c400e7245e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPO4SGYDFLJOFHJOPOKS2566ZD/bundle.json","state_url":"https://pith.science/pith/LPO4SGYDFLJOFHJOPOKS2566ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPO4SGYDFLJOFHJOPOKS2566ZD/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-05-30T09:20:32Z","links":{"resolver":"https://pith.science/pith/LPO4SGYDFLJOFHJOPOKS2566ZD","bundle":"https://pith.science/pith/LPO4SGYDFLJOFHJOPOKS2566ZD/bundle.json","state":"https://pith.science/pith/LPO4SGYDFLJOFHJOPOKS2566ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPO4SGYDFLJOFHJOPOKS2566ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LPO4SGYDFLJOFHJOPOKS2566ZD","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":"f9f9653a9cc537489435ee005eb8b8a03669fcf1ff34bcb6244c321b86cebf0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T19:50:24Z","title_canon_sha256":"1debfe9152ae5e408599c76b94b59092533c4d23a46f53c6d3febb80c5865f30"},"schema_version":"1.0","source":{"id":"1105.1764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1764","created_at":"2026-05-18T04:22:32Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1764v1","created_at":"2026-05-18T04:22:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1764","created_at":"2026-05-18T04:22:32Z"},{"alias_kind":"pith_short_12","alias_value":"LPO4SGYDFLJO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LPO4SGYDFLJOFHJO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LPO4SGYD","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:ce2b200af0477c9732d11d54f78b20c2a34b7a011a686fcba91e50c400e7245e","target":"graph","created_at":"2026-05-18T04:22: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":"Define f(n,p) to be the maximum number of edges in a graph on n vertices with p perfect matchings. Dudek and Schmitt proved there exist constants n_p and c_p so that for even n >= n_p, f(n,p) = (n^2)/4+c_p. A graph is p-extremal if it has p perfect matchings and (n^2)/4+c_p edges. Based on Lovasz's Two Ear Theorem and structural results of Hartke, Stolee, West, and Yancey, we develop a computational method for determining c_p and generating the finite set of graphs which describe the infinite family of p-extremal graphs. This method extends the knowledge of the size and structure of p-extremal","authors_text":"Derrick Stolee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T19:50:24Z","title":"Generating p-extremal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1764","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:e73e4786bac5fcf5e0bd2930ab710236b9771c549f0a0fb86c7a60a72af5429f","target":"record","created_at":"2026-05-18T04:22: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":"f9f9653a9cc537489435ee005eb8b8a03669fcf1ff34bcb6244c321b86cebf0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-09T19:50:24Z","title_canon_sha256":"1debfe9152ae5e408599c76b94b59092533c4d23a46f53c6d3febb80c5865f30"},"schema_version":"1.0","source":{"id":"1105.1764","kind":"arxiv","version":1}},"canonical_sha256":"5bddc91b032ad2e29d2e7b952d77dec8f7f23788051ae37e4416ec7ce302aa8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bddc91b032ad2e29d2e7b952d77dec8f7f23788051ae37e4416ec7ce302aa8f","first_computed_at":"2026-05-18T04:22:32.536632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:32.536632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4KumhZZ9MCRJf6PSQhppFeBrrmkRr6Cv2DQ0JOff2U/AAMeObxMCnmG32Mt3I9Yp9Uw0XHnz/lOQrUFOB/VYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:32.537201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e73e4786bac5fcf5e0bd2930ab710236b9771c549f0a0fb86c7a60a72af5429f","sha256:ce2b200af0477c9732d11d54f78b20c2a34b7a011a686fcba91e50c400e7245e"],"state_sha256":"c669b7f7a45e85c7fc1a74d7935ea38ea4df925a7e868300b7b0bec75b0c0db5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YP2pjgx0EbbRxc1havCQ2Cp/yK8YXDalhcFeWwfIrtNmaMyclpkTt+7+mhE5G04d6X+se9Id5dla+rYsGusECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:20:32.454047Z","bundle_sha256":"e104af6c894b8e6f62a0709a68c6192dc242ac8497587e5e03b7763bad39844d"}}