{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:HMAFCNT3FHNOTYXOTKGFWITLXN","short_pith_number":"pith:HMAFCNT3","canonical_record":{"source":{"id":"0903.4907","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-03-28T02:15:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a9eb780d98e30ef1047cd452944c7d96c25c8c8b189caadb2173ffc2106c94a8","abstract_canon_sha256":"f36025ca7f4f33903a4f160d45fcbef9f16916b2bcc6487301a0aae5334b27b8"},"schema_version":"1.0"},"canonical_sha256":"3b0051367b29dae9e2ee9a8c5b226bbb5beb497caa1d84401afb295ec3acb221","source":{"kind":"arxiv","id":"0903.4907","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:HMAFCNT3FHNOTYXOTKGFWITLXN","target":"record","payload":{"canonical_record":{"source":{"id":"0903.4907","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-03-28T02:15:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a9eb780d98e30ef1047cd452944c7d96c25c8c8b189caadb2173ffc2106c94a8","abstract_canon_sha256":"f36025ca7f4f33903a4f160d45fcbef9f16916b2bcc6487301a0aae5334b27b8"},"schema_version":"1.0"},"canonical_sha256":"3b0051367b29dae9e2ee9a8c5b226bbb5beb497caa1d84401afb295ec3acb221","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:44.185641Z","signature_b64":"iR/rJiRLeIlCtECzLWks7lHifIDWWow5aiZxTVfI31OXzS8z2nR5KeJo/pJ5gOl8QQpV0gKuyTSp7++7xopFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0051367b29dae9e2ee9a8c5b226bbb5beb497caa1d84401afb295ec3acb221","last_reissued_at":"2026-05-18T01:24:44.185046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:44.185046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.4907","source_version":4,"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-18T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cPrNdrRfMO1SOAT50EtuEEbj67CIBVspFgXAslUdjYGiQ3rHmrsAxwDKCp3VHXAvASJk1q2dj01tHzoBbvVgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T05:27:58.961086Z"},"content_sha256":"f476d25a63f3dec47692cf1994958c5fd348f9799ea6d836b61493e01ffa9f2e","schema_version":"1.0","event_id":"sha256:f476d25a63f3dec47692cf1994958c5fd348f9799ea6d836b61493e01ffa9f2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:HMAFCNT3FHNOTYXOTKGFWITLXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The hardness of the independence and matching clutter of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hovhannes Sargsyan, Sasun Hambardzumyan, Vahan V. Mkrtchyan, Vahe L. Musoyan","submitted_at":"2009-03-28T02:15:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.4907","kind":"arxiv","version":4},"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-18T01:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"maZnEty7msuHmlWXlxZ3VF8KC3b4l9sFYAVrrD6CfItYbcgJdxghVtQjubxVKZNRXxN05sOAJyhOuNG+RC/eCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T05:27:58.961446Z"},"content_sha256":"354abbb8dbf2a69cb2f78b113a29549452eb4fc99082e80de2224a9c1bb3759d","schema_version":"1.0","event_id":"sha256:354abbb8dbf2a69cb2f78b113a29549452eb4fc99082e80de2224a9c1bb3759d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMAFCNT3FHNOTYXOTKGFWITLXN/bundle.json","state_url":"https://pith.science/pith/HMAFCNT3FHNOTYXOTKGFWITLXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMAFCNT3FHNOTYXOTKGFWITLXN/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-21T05:27:58Z","links":{"resolver":"https://pith.science/pith/HMAFCNT3FHNOTYXOTKGFWITLXN","bundle":"https://pith.science/pith/HMAFCNT3FHNOTYXOTKGFWITLXN/bundle.json","state":"https://pith.science/pith/HMAFCNT3FHNOTYXOTKGFWITLXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMAFCNT3FHNOTYXOTKGFWITLXN/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgTwVgPn8z8aFcdWuam+bpBuOryIN6ENAfoP+fGA895IjJlPe4M4wn8YTt/xLUV10DJ+UjezvqYXQBRY4PP4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T05:27:58.963355Z","bundle_sha256":"8f8d3724bc770b62ac0526b980dc24c8c5e9bd64517a3c783760d21293ab16f0"}}