{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:HMAFCNT3FHNOTYXOTKGFWITLXN","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":"f36025ca7f4f33903a4f160d45fcbef9f16916b2bcc6487301a0aae5334b27b8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-03-28T02:15:17Z","title_canon_sha256":"a9eb780d98e30ef1047cd452944c7d96c25c8c8b189caadb2173ffc2106c94a8"},"schema_version":"1.0","source":{"id":"0903.4907","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.4907","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"0903.4907v4","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.4907","created_at":"2026-05-18T01:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"HMAFCNT3FHNO","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HMAFCNT3FHNOTYXO","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HMAFCNT3","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:354abbb8dbf2a69cb2f78b113a29549452eb4fc99082e80de2224a9c1bb3759d","target":"graph","created_at":"2026-05-18T01:24:44Z","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":"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. Usually, 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 called {\\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 max","authors_text":"Hovhannes Sargsyan, Sasun Hambardzumyan, Vahan V. Mkrtchyan, Vahe L. Musoyan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-03-28T02:15:17Z","title":"The hardness of the independence and matching clutter of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4907","kind":"arxiv","version":4},"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:f476d25a63f3dec47692cf1994958c5fd348f9799ea6d836b61493e01ffa9f2e","target":"record","created_at":"2026-05-18T01:24:44Z","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":"f36025ca7f4f33903a4f160d45fcbef9f16916b2bcc6487301a0aae5334b27b8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-03-28T02:15:17Z","title_canon_sha256":"a9eb780d98e30ef1047cd452944c7d96c25c8c8b189caadb2173ffc2106c94a8"},"schema_version":"1.0","source":{"id":"0903.4907","kind":"arxiv","version":4}},"canonical_sha256":"3b0051367b29dae9e2ee9a8c5b226bbb5beb497caa1d84401afb295ec3acb221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b0051367b29dae9e2ee9a8c5b226bbb5beb497caa1d84401afb295ec3acb221","first_computed_at":"2026-05-18T01:24:44.185046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:44.185046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iR/rJiRLeIlCtECzLWks7lHifIDWWow5aiZxTVfI31OXzS8z2nR5KeJo/pJ5gOl8QQpV0gKuyTSp7++7xopFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:44.185641Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.4907","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f476d25a63f3dec47692cf1994958c5fd348f9799ea6d836b61493e01ffa9f2e","sha256:354abbb8dbf2a69cb2f78b113a29549452eb4fc99082e80de2224a9c1bb3759d"],"state_sha256":"372eb1c5f8c2110cd50f6575210b7dc8515daaa48cb3dfa606b315666f26ac39"}