{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5RX4LV5EU63UQWZALKNDHD3UHN","short_pith_number":"pith:5RX4LV5E","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"},"canonical_sha256":"ec6fc5d7a4a7b7485b205a9a338f743b580ad7ceab6c4482c43a7d6a7a52d35a","source":{"kind":"arxiv","id":"1503.01203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01203","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01203v2","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01203","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"5RX4LV5EU63U","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5RX4LV5EU63UQWZA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5RX4LV5E","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5RX4LV5EU63UQWZALKNDHD3UHN","target":"record","payload":{"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"},"canonical_sha256":"ec6fc5d7a4a7b7485b205a9a338f743b580ad7ceab6c4482c43a7d6a7a52d35a","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"},"source_kind":"arxiv","source_id":"1503.01203","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:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ex6A+BidjXZ5cZG3MW6kRWjHnW3CY8KyWkG4YhwP5Ptc9lUF3L9jvRCOrsyvfBN1InKmx9Cl1x1hWuAHBJhbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:37:14.602560Z"},"content_sha256":"6668fe0e69b61b3d42cc571f3deda089aed726ef95b52cfe35febdb4b7888185","schema_version":"1.0","event_id":"sha256:6668fe0e69b61b3d42cc571f3deda089aed726ef95b52cfe35febdb4b7888185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5RX4LV5EU63UQWZALKNDHD3UHN","target":"graph","payload":{"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"},"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:19:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L0DG1IlYvJCgClRp5niPc0LYGt0uFeozXgJi9TaHqzCEU2s4gg+DJkKOMamuqwTD8Mm72orhPbA6dO/BWICJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:37:14.602905Z"},"content_sha256":"1e31058249a4972ab6804d625ca9550d98bd45b76ada0e63c040f4c5abd5e9c9","schema_version":"1.0","event_id":"sha256:1e31058249a4972ab6804d625ca9550d98bd45b76ada0e63c040f4c5abd5e9c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/bundle.json","state_url":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RX4LV5EU63UQWZALKNDHD3UHN/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-03T22:37:14Z","links":{"resolver":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN","bundle":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/bundle.json","state":"https://pith.science/pith/5RX4LV5EU63UQWZALKNDHD3UHN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RX4LV5EU63UQWZALKNDHD3UHN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5RX4LV5EU63UQWZALKNDHD3UHN","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":"94d571e43c6739c5096d6e4a2007c4a8d5116a1c0a66f006ab67b50893398c92","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-04T03:05:21Z","title_canon_sha256":"6411c8b8674116d0253aa5612434c3f995c89ea8e4f204ec46476e38dc580683"},"schema_version":"1.0","source":{"id":"1503.01203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01203","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01203v2","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01203","created_at":"2026-05-18T02:19:43Z"},{"alias_kind":"pith_short_12","alias_value":"5RX4LV5EU63U","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"5RX4LV5EU63UQWZA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"5RX4LV5E","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:1e31058249a4972ab6804d625ca9550d98bd45b76ada0e63c040f4c5abd5e9c9","target":"graph","created_at":"2026-05-18T02:19:43Z","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 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.","authors_text":"Serge Gaspers, Simon Mackenzie","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-04T03:05:21Z","title":"On the Number of Minimal Separators in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01203","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:6668fe0e69b61b3d42cc571f3deda089aed726ef95b52cfe35febdb4b7888185","target":"record","created_at":"2026-05-18T02:19:43Z","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":"94d571e43c6739c5096d6e4a2007c4a8d5116a1c0a66f006ab67b50893398c92","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-04T03:05:21Z","title_canon_sha256":"6411c8b8674116d0253aa5612434c3f995c89ea8e4f204ec46476e38dc580683"},"schema_version":"1.0","source":{"id":"1503.01203","kind":"arxiv","version":2}},"canonical_sha256":"ec6fc5d7a4a7b7485b205a9a338f743b580ad7ceab6c4482c43a7d6a7a52d35a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec6fc5d7a4a7b7485b205a9a338f743b580ad7ceab6c4482c43a7d6a7a52d35a","first_computed_at":"2026-05-18T02:19:43.550474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:43.550474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g2JUc8ZG+Qo/dzkRlGMZZYhELI6nQYWgYT/fuXnI9JNTLDYIZfp529nNQ76R7xYAzCrlLNzpTGQPnbrwHpj6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:43.550899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6668fe0e69b61b3d42cc571f3deda089aed726ef95b52cfe35febdb4b7888185","sha256:1e31058249a4972ab6804d625ca9550d98bd45b76ada0e63c040f4c5abd5e9c9"],"state_sha256":"a6198ae39019d5a9cb75370234231450e276362b83e8df3d21b8e7ae34e66e37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62YdyWU4ydRqM44WMitrbJApHoADE5RvWrfrAkEwK0Fal1AmWU/+usL7w+Q7Cri+LPN/52SyRcm6wC1Hi5azDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:37:14.604847Z","bundle_sha256":"95c27b7e37c77401247582b802a46380768ad94c9509f3cdb8e38247d13796cd"}}