{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JKEXIPKU7FGHCRM4567KUHLP3M","short_pith_number":"pith:JKEXIPKU","schema_version":"1.0","canonical_sha256":"4a89743d54f94c71459cefbeaa1d6fdb087f2f96a89f64a107955909767b63b8","source":{"kind":"arxiv","id":"1109.6179","version":3},"attestation_state":"computed","paper":{"title":"On maximal S-free sets and the Helly number for the family of S-convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"math.OC","authors_text":"Gennadiy Averkov","submitted_at":"2011-09-28T12:00:54Z","abstract_excerpt":"We study two combinatorial parameters, which we denote by f(S) and h(S), associated to an arbitrary set S \\subseteq R^d, where d \\in N. In the nondegenerate situation, f(S) is the largest possible number of facets of a d-dimensional polyhedron L such that the interior of L is disjoint with S and L is inclusion-maximal with respect to this property. The parameter h(S) is the Helly number of the family of all sets that can be given as the intersection of S with a convex subset of R^d. We obtain the inequality f(S) \\le h(S) for an arbitrary S and the equality f(S)=h(S) for every discrete S. Furth"},"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":"1109.6179","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-28T12:00:54Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"ac4baa90721dfb4cef96c4b2134a3f30f646fd667bb0c63e915343c4c75e1263","abstract_canon_sha256":"3e5952438fb467cbd79d085b386de207f1d0c4891cde9232f57d935661cb54e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:13.476504Z","signature_b64":"CR6SEKGD+tHkhL5kk3T2ojHLahz2+YUURTrA6zzZaXE07RxeI+xWEx/hgGJ/B8U8G+t40dURmYTgGw0jkI6vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a89743d54f94c71459cefbeaa1d6fdb087f2f96a89f64a107955909767b63b8","last_reissued_at":"2026-05-18T03:19:13.475857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:13.475857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximal S-free sets and the Helly number for the family of S-convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"math.OC","authors_text":"Gennadiy Averkov","submitted_at":"2011-09-28T12:00:54Z","abstract_excerpt":"We study two combinatorial parameters, which we denote by f(S) and h(S), associated to an arbitrary set S \\subseteq R^d, where d \\in N. In the nondegenerate situation, f(S) is the largest possible number of facets of a d-dimensional polyhedron L such that the interior of L is disjoint with S and L is inclusion-maximal with respect to this property. The parameter h(S) is the Helly number of the family of all sets that can be given as the intersection of S with a convex subset of R^d. We obtain the inequality f(S) \\le h(S) for an arbitrary S and the equality f(S)=h(S) for every discrete S. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6179","kind":"arxiv","version":3},"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":"1109.6179","created_at":"2026-05-18T03:19:13.475952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6179v3","created_at":"2026-05-18T03:19:13.475952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6179","created_at":"2026-05-18T03:19:13.475952+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKEXIPKU7FGH","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKEXIPKU7FGHCRM4","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKEXIPKU","created_at":"2026-05-18T12:26:32.869790+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/JKEXIPKU7FGHCRM4567KUHLP3M","json":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M.json","graph_json":"https://pith.science/api/pith-number/JKEXIPKU7FGHCRM4567KUHLP3M/graph.json","events_json":"https://pith.science/api/pith-number/JKEXIPKU7FGHCRM4567KUHLP3M/events.json","paper":"https://pith.science/paper/JKEXIPKU"},"agent_actions":{"view_html":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M","download_json":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M.json","view_paper":"https://pith.science/paper/JKEXIPKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6179&json=true","fetch_graph":"https://pith.science/api/pith-number/JKEXIPKU7FGHCRM4567KUHLP3M/graph.json","fetch_events":"https://pith.science/api/pith-number/JKEXIPKU7FGHCRM4567KUHLP3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M/action/storage_attestation","attest_author":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M/action/author_attestation","sign_citation":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M/action/citation_signature","submit_replication":"https://pith.science/pith/JKEXIPKU7FGHCRM4567KUHLP3M/action/replication_record"}},"created_at":"2026-05-18T03:19:13.475952+00:00","updated_at":"2026-05-18T03:19:13.475952+00:00"}