{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K7ETVLKSHAPBLBIPYFZ5YBQWH6","short_pith_number":"pith:K7ETVLKS","schema_version":"1.0","canonical_sha256":"57c93aad52381e15850fc173dc06163f98e4ad1713722e013b9faf6b6d4e6757","source":{"kind":"arxiv","id":"2409.02974","version":2},"attestation_state":"computed","paper":{"title":"On a question of Erd\\H{o}s and Ne\\v{s}et\\v{r}il about minimal cuts in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}","submitted_at":"2024-09-04T12:19:53Z","abstract_excerpt":"Answering a question of Erd\\H{o}s and Ne\\v{s}et\\v{r}il, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most $1.8899^n$ for large enough $n$."},"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":"2409.02974","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-04T12:19:53Z","cross_cats_sorted":[],"title_canon_sha256":"a4e09b6cdea247709ef71d3757890e5976b938b2ada2625b5bf2366833c08ea9","abstract_canon_sha256":"eff6d18f8a48a4922830420e4f88c1ea7d838149c4309173bf2e2d86c71a991b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:55.706206Z","signature_b64":"xwxBllvfwFp+C0f2px5dvQ3Ej4nWf3x0XTZCgelDc8zF3GZz05wpMhvIhcSWy2B+HG6bx4Gzfh5SfZUsyYiPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c93aad52381e15850fc173dc06163f98e4ad1713722e013b9faf6b6d4e6757","last_reissued_at":"2026-06-24T01:14:55.705788Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:55.705788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a question of Erd\\H{o}s and Ne\\v{s}et\\v{r}il about minimal cuts in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}","submitted_at":"2024-09-04T12:19:53Z","abstract_excerpt":"Answering a question of Erd\\H{o}s and Ne\\v{s}et\\v{r}il, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most $1.8899^n$ for large enough $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02974","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.02974/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.02974","created_at":"2026-06-24T01:14:55.705841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.02974v2","created_at":"2026-06-24T01:14:55.705841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02974","created_at":"2026-06-24T01:14:55.705841+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7ETVLKSHAPB","created_at":"2026-06-24T01:14:55.705841+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7ETVLKSHAPBLBIP","created_at":"2026-06-24T01:14:55.705841+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7ETVLKS","created_at":"2026-06-24T01:14:55.705841+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/K7ETVLKSHAPBLBIPYFZ5YBQWH6","json":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6.json","graph_json":"https://pith.science/api/pith-number/K7ETVLKSHAPBLBIPYFZ5YBQWH6/graph.json","events_json":"https://pith.science/api/pith-number/K7ETVLKSHAPBLBIPYFZ5YBQWH6/events.json","paper":"https://pith.science/paper/K7ETVLKS"},"agent_actions":{"view_html":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6","download_json":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6.json","view_paper":"https://pith.science/paper/K7ETVLKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.02974&json=true","fetch_graph":"https://pith.science/api/pith-number/K7ETVLKSHAPBLBIPYFZ5YBQWH6/graph.json","fetch_events":"https://pith.science/api/pith-number/K7ETVLKSHAPBLBIPYFZ5YBQWH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6/action/storage_attestation","attest_author":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6/action/author_attestation","sign_citation":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6/action/citation_signature","submit_replication":"https://pith.science/pith/K7ETVLKSHAPBLBIPYFZ5YBQWH6/action/replication_record"}},"created_at":"2026-06-24T01:14:55.705841+00:00","updated_at":"2026-06-24T01:14:55.705841+00:00"}