{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XO7FDMSLAEV4QADKRV5WNKR3PO","short_pith_number":"pith:XO7FDMSL","canonical_record":{"source":{"id":"1601.00032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-01T00:02:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b45fc011bca703425e0633f31fe840019c99338baf147d7effbc255c803ff6a4","abstract_canon_sha256":"b09b34ba996a01e07e3580184068516a7c7c6d75898ba92d5d8fd27ef6fa1360"},"schema_version":"1.0"},"canonical_sha256":"bbbe51b24b012bc8006a8d7b66aa3b7b8cb601d55c5598f11b77b4e2a3dd7cc4","source":{"kind":"arxiv","id":"1601.00032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00032","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00032v1","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00032","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"XO7FDMSLAEV4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XO7FDMSLAEV4QADK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XO7FDMSL","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XO7FDMSLAEV4QADKRV5WNKR3PO","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-01T00:02:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b45fc011bca703425e0633f31fe840019c99338baf147d7effbc255c803ff6a4","abstract_canon_sha256":"b09b34ba996a01e07e3580184068516a7c7c6d75898ba92d5d8fd27ef6fa1360"},"schema_version":"1.0"},"canonical_sha256":"bbbe51b24b012bc8006a8d7b66aa3b7b8cb601d55c5598f11b77b4e2a3dd7cc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:31.998836Z","signature_b64":"4YAU98CRUVJVA2/BvJk0G0KfvpPplRvNPuebSQV+tZQOLxsupCgEdGC0SIe8gtVropGnEHa91mibaz3WCbWsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbbe51b24b012bc8006a8d7b66aa3b7b8cb601d55c5598f11b77b4e2a3dd7cc4","last_reissued_at":"2026-05-18T01:23:31.998167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:31.998167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00032","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-18T01:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMomq7oG4+JhfpNu1qQ2eOhNX49vwI5OKM1yUXpDio2np4cAqGS72b+bCxapo8bM/PQFqo96q0KKt+MHmu4MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:23:31.231105Z"},"content_sha256":"b0d492c4795fa65b494ac72384235121e10be2598498a4b9b54a6395d09438fb","schema_version":"1.0","event_id":"sha256:b0d492c4795fa65b494ac72384235121e10be2598498a4b9b54a6395d09438fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XO7FDMSLAEV4QADKRV5WNKR3PO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighborhood covering and independence on two superclasses of cographs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Guillermo Dur\\'an, Mart\\'in D. Safe, Xavier S. Warnes","submitted_at":"2016-01-01T00:02:19Z","abstract_excerpt":"Given a simple graph $G$, a set $C \\subseteq V(G)$ is a neighborhood cover set if every edge and vertex of $G$ belongs to some $G[v]$ with $v \\in C$, where $G[v]$ denotes the subgraph of $G$ induced by the closed neighborhood of the vertex $v$. Two elements of $E(G) \\cup V(G)$ are neighborhood-independent if there is no vertex $v\\in V(G)$ such that both elements are in $G[v]$. A set $S\\subseteq V(G)\\cup E(G)$ is neighborhood-independent if every pair of elements of $S$ is neighborhood-independent. Let $\\rho_{\\mathrm n}(G)$ be the size of a minimum neighborhood cover set and $\\alpha_{\\mathrm n}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00032","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-18T01:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"co0IytCdnlYKm+7wELqzvBqFFETrAP8cCx2TLGwfYoDnNNlMjtBqdFedBaPx+sA4xSkHW28X9Zn1MqK36VmOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:23:31.231809Z"},"content_sha256":"70dcb65c588efe816010f7926086c8d868883ffe0fecf8d3976ac52bf501e831","schema_version":"1.0","event_id":"sha256:70dcb65c588efe816010f7926086c8d868883ffe0fecf8d3976ac52bf501e831"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/bundle.json","state_url":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/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-05-31T23:23:31Z","links":{"resolver":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO","bundle":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/bundle.json","state":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XO7FDMSLAEV4QADKRV5WNKR3PO","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":"b09b34ba996a01e07e3580184068516a7c7c6d75898ba92d5d8fd27ef6fa1360","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-01T00:02:19Z","title_canon_sha256":"b45fc011bca703425e0633f31fe840019c99338baf147d7effbc255c803ff6a4"},"schema_version":"1.0","source":{"id":"1601.00032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00032","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00032v1","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00032","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"XO7FDMSLAEV4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XO7FDMSLAEV4QADK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XO7FDMSL","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:70dcb65c588efe816010f7926086c8d868883ffe0fecf8d3976ac52bf501e831","target":"graph","created_at":"2026-05-18T01:23:31Z","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":"Given a simple graph $G$, a set $C \\subseteq V(G)$ is a neighborhood cover set if every edge and vertex of $G$ belongs to some $G[v]$ with $v \\in C$, where $G[v]$ denotes the subgraph of $G$ induced by the closed neighborhood of the vertex $v$. Two elements of $E(G) \\cup V(G)$ are neighborhood-independent if there is no vertex $v\\in V(G)$ such that both elements are in $G[v]$. A set $S\\subseteq V(G)\\cup E(G)$ is neighborhood-independent if every pair of elements of $S$ is neighborhood-independent. Let $\\rho_{\\mathrm n}(G)$ be the size of a minimum neighborhood cover set and $\\alpha_{\\mathrm n}","authors_text":"Guillermo Dur\\'an, Mart\\'in D. Safe, Xavier S. Warnes","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-01T00:02:19Z","title":"Neighborhood covering and independence on two superclasses of cographs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00032","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:b0d492c4795fa65b494ac72384235121e10be2598498a4b9b54a6395d09438fb","target":"record","created_at":"2026-05-18T01:23:31Z","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":"b09b34ba996a01e07e3580184068516a7c7c6d75898ba92d5d8fd27ef6fa1360","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-01T00:02:19Z","title_canon_sha256":"b45fc011bca703425e0633f31fe840019c99338baf147d7effbc255c803ff6a4"},"schema_version":"1.0","source":{"id":"1601.00032","kind":"arxiv","version":1}},"canonical_sha256":"bbbe51b24b012bc8006a8d7b66aa3b7b8cb601d55c5598f11b77b4e2a3dd7cc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbbe51b24b012bc8006a8d7b66aa3b7b8cb601d55c5598f11b77b4e2a3dd7cc4","first_computed_at":"2026-05-18T01:23:31.998167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:31.998167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4YAU98CRUVJVA2/BvJk0G0KfvpPplRvNPuebSQV+tZQOLxsupCgEdGC0SIe8gtVropGnEHa91mibaz3WCbWsDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:31.998836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d492c4795fa65b494ac72384235121e10be2598498a4b9b54a6395d09438fb","sha256:70dcb65c588efe816010f7926086c8d868883ffe0fecf8d3976ac52bf501e831"],"state_sha256":"34ef51123d4b16516aef7eb12f00d088ae1955b529609b8eacb90c0249f29260"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXT73GEOJwHR6qAvBSLCTrfWA1ks92oXz+0/WAgPKW+nnZ056E46YmIQ8CAUnscXEunRkOmZ174xOoqtLdegDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:23:31.235762Z","bundle_sha256":"62d9d013e6b56a471b442678563d0e6a636e9e5151a07fb5809c545b05ecab11"}}