{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XO7FDMSLAEV4QADKRV5WNKR3PO","short_pith_number":"pith:XO7FDMSL","schema_version":"1.0","canonical_sha256":"bbbe51b24b012bc8006a8d7b66aa3b7b8cb601d55c5598f11b77b4e2a3dd7cc4","source":{"kind":"arxiv","id":"1601.00032","version":1},"attestation_state":"computed","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}"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.00032","created_at":"2026-05-18T01:23:31.998286+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.00032v1","created_at":"2026-05-18T01:23:31.998286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00032","created_at":"2026-05-18T01:23:31.998286+00:00"},{"alias_kind":"pith_short_12","alias_value":"XO7FDMSLAEV4","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XO7FDMSLAEV4QADK","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XO7FDMSL","created_at":"2026-05-18T12:30:51.357362+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/XO7FDMSLAEV4QADKRV5WNKR3PO","json":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO.json","graph_json":"https://pith.science/api/pith-number/XO7FDMSLAEV4QADKRV5WNKR3PO/graph.json","events_json":"https://pith.science/api/pith-number/XO7FDMSLAEV4QADKRV5WNKR3PO/events.json","paper":"https://pith.science/paper/XO7FDMSL"},"agent_actions":{"view_html":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO","download_json":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO.json","view_paper":"https://pith.science/paper/XO7FDMSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.00032&json=true","fetch_graph":"https://pith.science/api/pith-number/XO7FDMSLAEV4QADKRV5WNKR3PO/graph.json","fetch_events":"https://pith.science/api/pith-number/XO7FDMSLAEV4QADKRV5WNKR3PO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/action/storage_attestation","attest_author":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/action/author_attestation","sign_citation":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/action/citation_signature","submit_replication":"https://pith.science/pith/XO7FDMSLAEV4QADKRV5WNKR3PO/action/replication_record"}},"created_at":"2026-05-18T01:23:31.998286+00:00","updated_at":"2026-05-18T01:23:31.998286+00:00"}