{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5RX4LV5EU63UQWZALKNDHD3UHN","short_pith_number":"pith:5RX4LV5E","schema_version":"1.0","canonical_sha256":"ec6fc5d7a4a7b7485b205a9a338f743b580ad7ceab6c4482c43a7d6a7a52d35a","source":{"kind":"arxiv","id":"1503.01203","version":2},"attestation_state":"computed","paper":{"title":"On the Number of Minimal Separators in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Serge Gaspers, Simon Mackenzie","submitted_at":"2015-03-04T03:05:21Z","abstract_excerpt":"We consider the largest number of minimal separators a graph on n vertices can have at most.\n  We give a new proof that this number is in $O( ((1+\\sqrt{5})/2)^n n )$.\n  We prove that this number is in $\\omega( 1.4521^n )$, improving on the previous best lower bound of $\\Omega(3^{n/3}) \\subseteq \\omega( 1.4422^n )$.\n  This gives also an improved lower bound on the number of potential maximal cliques in a graph. We would like to emphasize that our proofs are short, simple, and elementary."},"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":"1503.01203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-04T03:05:21Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"6411c8b8674116d0253aa5612434c3f995c89ea8e4f204ec46476e38dc580683","abstract_canon_sha256":"94d571e43c6739c5096d6e4a2007c4a8d5116a1c0a66f006ab67b50893398c92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.550899Z","signature_b64":"g2JUc8ZG+Qo/dzkRlGMZZYhELI6nQYWgYT/fuXnI9JNTLDYIZfp529nNQ76R7xYAzCrlLNzpTGQPnbrwHpj6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec6fc5d7a4a7b7485b205a9a338f743b580ad7ceab6c4482c43a7d6a7a52d35a","last_reissued_at":"2026-05-18T02:19:43.550474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.550474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Minimal Separators in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Serge Gaspers, Simon Mackenzie","submitted_at":"2015-03-04T03:05:21Z","abstract_excerpt":"We consider the largest number of minimal separators a graph on n vertices can have at most.\n  We give a new proof that this number is in $O( ((1+\\sqrt{5})/2)^n n )$.\n  We prove that this number is in $\\omega( 1.4521^n )$, improving on the previous best lower bound of $\\Omega(3^{n/3}) \\subseteq \\omega( 1.4422^n )$.\n  This gives also an improved lower bound on the number of potential maximal cliques in a graph. We would like to emphasize that our proofs are short, simple, and elementary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01203","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":"1503.01203","created_at":"2026-05-18T02:19:43.550544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01203v2","created_at":"2026-05-18T02:19:43.550544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01203","created_at":"2026-05-18T02:19:43.550544+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RX4LV5EU63U","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RX4LV5EU63UQWZA","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RX4LV5E","created_at":"2026-05-18T12:29:07.941421+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/5RX4LV5EU63UQWZALKNDHD3UHN","json":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN.json","graph_json":"https://pith.science/api/pith-number/5RX4LV5EU63UQWZALKNDHD3UHN/graph.json","events_json":"https://pith.science/api/pith-number/5RX4LV5EU63UQWZALKNDHD3UHN/events.json","paper":"https://pith.science/paper/5RX4LV5E"},"agent_actions":{"view_html":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN","download_json":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN.json","view_paper":"https://pith.science/paper/5RX4LV5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01203&json=true","fetch_graph":"https://pith.science/api/pith-number/5RX4LV5EU63UQWZALKNDHD3UHN/graph.json","fetch_events":"https://pith.science/api/pith-number/5RX4LV5EU63UQWZALKNDHD3UHN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/action/storage_attestation","attest_author":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/action/author_attestation","sign_citation":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/action/citation_signature","submit_replication":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/action/replication_record"}},"created_at":"2026-05-18T02:19:43.550544+00:00","updated_at":"2026-05-18T02:19:43.550544+00:00"}