{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MBUM7BMAHUMOR6Z7D45I3NJOYF","short_pith_number":"pith:MBUM7BMA","canonical_record":{"source":{"id":"1907.07414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-17T09:48:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6b58edb782c496f89db4a021bdd0803c41d81567679578ab84fd207a3982e227","abstract_canon_sha256":"11bf2b45e744fedeb4ca72f2f9e7c7ec72d30c95ea9514c8becc6f40a8c96f7f"},"schema_version":"1.0"},"canonical_sha256":"6068cf85803d18e8fb3f1f3a8db52ec14c719f257655c92b624fde55f44ee2e8","source":{"kind":"arxiv","id":"1907.07414","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07414","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07414v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07414","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"MBUM7BMAHUMO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBUM7BMAHUMOR6Z7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBUM7BMA","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MBUM7BMAHUMOR6Z7D45I3NJOYF","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07414","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-17T09:48:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6b58edb782c496f89db4a021bdd0803c41d81567679578ab84fd207a3982e227","abstract_canon_sha256":"11bf2b45e744fedeb4ca72f2f9e7c7ec72d30c95ea9514c8becc6f40a8c96f7f"},"schema_version":"1.0"},"canonical_sha256":"6068cf85803d18e8fb3f1f3a8db52ec14c719f257655c92b624fde55f44ee2e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:22.320807Z","signature_b64":"lwYUA7LYjN6gjzKZSgRVhDL3jvyVm0sPeSgXqbQd2mWgCCaqsRIJRefsy6csX5uuKrgs5ZZe8Dx2Brffso9YDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6068cf85803d18e8fb3f1f3a8db52ec14c719f257655c92b624fde55f44ee2e8","last_reissued_at":"2026-05-17T23:40:22.319973Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:22.319973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07414","source_version":1,"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-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46DBEPrXemC/XnjfbB8PaajEfc9kwC83zllf0E6jwRx+ouVvP1SDOjy6SQRyU3pHOtIL2Ng4Xz9xogrA8eHXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:08:26.244652Z"},"content_sha256":"5d25ea8d3b551f7bd5e748526fb918257b68dbef9ca38a788b8c91bf5c7c1d51","schema_version":"1.0","event_id":"sha256:5d25ea8d3b551f7bd5e748526fb918257b68dbef9ca38a788b8c91bf5c7c1d51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MBUM7BMAHUMOR6Z7D45I3NJOYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Containment Graphs, Posets, and Related Classes of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Edward R. Scheinerman, Martin Charles Golumbic","submitted_at":"2019-07-17T09:48:34Z","abstract_excerpt":"In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph provided one can assign to each vertex $v_i \\in V $ a set $S_i \\in Z$ such that $v_i v_j \\in E$ if and only if $S_i \\subset S_j$ or $S_j \\subset S_i$ . Similarly, we call a (strict) partially ordered set $P = (V, <)$ a $Z$-containment poset if to each $v_i \\in V $ we can assign a set $S_i \\in Z$ such that $v_i < v_j$ if and only if $S_i \\subset S_j$. Obviously, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07414","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"},"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-17T23:40:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3N9++uqGpU/2wi5J3ushN7eF1hthWqp7W30dEuwqyPYth/FsPEfidevONKphVWy6ofHs9Qb2jGHtuxXLVNiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:08:26.244995Z"},"content_sha256":"932d288c580e4f2b39e9bf65c435eb125f53b733b097658f25ec80c630d264d9","schema_version":"1.0","event_id":"sha256:932d288c580e4f2b39e9bf65c435eb125f53b733b097658f25ec80c630d264d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF/bundle.json","state_url":"https://pith.science/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF/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-01T12:08:26Z","links":{"resolver":"https://pith.science/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF","bundle":"https://pith.science/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF/bundle.json","state":"https://pith.science/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBUM7BMAHUMOR6Z7D45I3NJOYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MBUM7BMAHUMOR6Z7D45I3NJOYF","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":"11bf2b45e744fedeb4ca72f2f9e7c7ec72d30c95ea9514c8becc6f40a8c96f7f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-17T09:48:34Z","title_canon_sha256":"6b58edb782c496f89db4a021bdd0803c41d81567679578ab84fd207a3982e227"},"schema_version":"1.0","source":{"id":"1907.07414","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07414","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07414v1","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07414","created_at":"2026-05-17T23:40:22Z"},{"alias_kind":"pith_short_12","alias_value":"MBUM7BMAHUMO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MBUM7BMAHUMOR6Z7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MBUM7BMA","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:932d288c580e4f2b39e9bf65c435eb125f53b733b097658f25ec80c630d264d9","target":"graph","created_at":"2026-05-17T23:40:22Z","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":"In this paper, we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets. Let $Z$ be a family of nonempty sets. We call a (simple, finite) graph G = (V, E) a $Z$-containment graph provided one can assign to each vertex $v_i \\in V $ a set $S_i \\in Z$ such that $v_i v_j \\in E$ if and only if $S_i \\subset S_j$ or $S_j \\subset S_i$ . Similarly, we call a (strict) partially ordered set $P = (V, <)$ a $Z$-containment poset if to each $v_i \\in V $ we can assign a set $S_i \\in Z$ such that $v_i < v_j$ if and only if $S_i \\subset S_j$. Obviously, ","authors_text":"Edward R. Scheinerman, Martin Charles Golumbic","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-17T09:48:34Z","title":"Containment Graphs, Posets, and Related Classes of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07414","kind":"arxiv","version":1},"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:5d25ea8d3b551f7bd5e748526fb918257b68dbef9ca38a788b8c91bf5c7c1d51","target":"record","created_at":"2026-05-17T23:40:22Z","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":"11bf2b45e744fedeb4ca72f2f9e7c7ec72d30c95ea9514c8becc6f40a8c96f7f","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-07-17T09:48:34Z","title_canon_sha256":"6b58edb782c496f89db4a021bdd0803c41d81567679578ab84fd207a3982e227"},"schema_version":"1.0","source":{"id":"1907.07414","kind":"arxiv","version":1}},"canonical_sha256":"6068cf85803d18e8fb3f1f3a8db52ec14c719f257655c92b624fde55f44ee2e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6068cf85803d18e8fb3f1f3a8db52ec14c719f257655c92b624fde55f44ee2e8","first_computed_at":"2026-05-17T23:40:22.319973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:22.319973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwYUA7LYjN6gjzKZSgRVhDL3jvyVm0sPeSgXqbQd2mWgCCaqsRIJRefsy6csX5uuKrgs5ZZe8Dx2Brffso9YDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:22.320807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07414","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d25ea8d3b551f7bd5e748526fb918257b68dbef9ca38a788b8c91bf5c7c1d51","sha256:932d288c580e4f2b39e9bf65c435eb125f53b733b097658f25ec80c630d264d9"],"state_sha256":"fa4b826607ada6d1fc9ad937d498750a6fa5d1b9d7ba8ff3b8d8b0724582bc44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epLaDCGioJ4f1dKrdoDWU/uYsCujucYLPR9SC6iAHSSA4RMKSRFMZSxNRWvfRhnGNRhkr+TZCsdtIRSm0uH8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:08:26.247025Z","bundle_sha256":"3f1d9af84e9e2946e741b033d53008d668417c0ed65bb3eadaa25b6a3b8be707"}}