{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H3RF6UM7I3VGMQALGDZFL7KVYL","short_pith_number":"pith:H3RF6UM7","schema_version":"1.0","canonical_sha256":"3ee25f519f46ea66400b30f255fd55c2c5208c91af563d2a0f6602eb4f5d1196","source":{"kind":"arxiv","id":"1807.06568","version":1},"attestation_state":"computed","paper":{"title":"A tight lower bound for the hardness of clutters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hovhannes Sargsyan, Vahan Mkrtchyan","submitted_at":"2018-07-17T17:22:33Z","abstract_excerpt":"A {\\it clutter} (or {\\it antichain} or {\\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Normally, the elements of $V$ are called {\\it vertices} of $L$, and the elements of $E$ are called {\\it edges} of $L$. A subset $s_e$ of an edge $e$ of a clutter is {\\it recognizing} for $e$, if $s_e$ is not a subset of another edge. The {\\it hardness} of an edge $e$ of a clutter is the ratio of the size of $e\\textrm{'s}$ smallest recognizing subset to the size of $e$. The hardness of a clutter is the maximum h"},"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":"1807.06568","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-17T17:22:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"287709865d4aed57950ae836ff5e9d3f74136165be100598bdae8a90873c7ecc","abstract_canon_sha256":"9ed953a5897c16b0929ba34a8969a417deee0d798246d4de14dea97c990f9617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:32.672620Z","signature_b64":"tnbUl2vFMURyTewdcDAZuJ3TG5XlmtTpmQ+t0oAXkZiBx1ZkCdBpClQiGiHO8Ckqr/LX3jJweJEjeE9v9kuvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ee25f519f46ea66400b30f255fd55c2c5208c91af563d2a0f6602eb4f5d1196","last_reissued_at":"2026-05-18T00:10:32.671965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:32.671965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A tight lower bound for the hardness of clutters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hovhannes Sargsyan, Vahan Mkrtchyan","submitted_at":"2018-07-17T17:22:33Z","abstract_excerpt":"A {\\it clutter} (or {\\it antichain} or {\\it Sperner family}) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Normally, the elements of $V$ are called {\\it vertices} of $L$, and the elements of $E$ are called {\\it edges} of $L$. A subset $s_e$ of an edge $e$ of a clutter is {\\it recognizing} for $e$, if $s_e$ is not a subset of another edge. The {\\it hardness} of an edge $e$ of a clutter is the ratio of the size of $e\\textrm{'s}$ smallest recognizing subset to the size of $e$. The hardness of a clutter is the maximum h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06568","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.06568","created_at":"2026-05-18T00:10:32.672047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.06568v1","created_at":"2026-05-18T00:10:32.672047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06568","created_at":"2026-05-18T00:10:32.672047+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3RF6UM7I3VG","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3RF6UM7I3VGMQAL","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3RF6UM7","created_at":"2026-05-18T12:32:28.185984+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/H3RF6UM7I3VGMQALGDZFL7KVYL","json":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL.json","graph_json":"https://pith.science/api/pith-number/H3RF6UM7I3VGMQALGDZFL7KVYL/graph.json","events_json":"https://pith.science/api/pith-number/H3RF6UM7I3VGMQALGDZFL7KVYL/events.json","paper":"https://pith.science/paper/H3RF6UM7"},"agent_actions":{"view_html":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL","download_json":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL.json","view_paper":"https://pith.science/paper/H3RF6UM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.06568&json=true","fetch_graph":"https://pith.science/api/pith-number/H3RF6UM7I3VGMQALGDZFL7KVYL/graph.json","fetch_events":"https://pith.science/api/pith-number/H3RF6UM7I3VGMQALGDZFL7KVYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL/action/storage_attestation","attest_author":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL/action/author_attestation","sign_citation":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL/action/citation_signature","submit_replication":"https://pith.science/pith/H3RF6UM7I3VGMQALGDZFL7KVYL/action/replication_record"}},"created_at":"2026-05-18T00:10:32.672047+00:00","updated_at":"2026-05-18T00:10:32.672047+00:00"}