{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YRBMCV6M4CFEKZJS6EKLPP6XOY","short_pith_number":"pith:YRBMCV6M","schema_version":"1.0","canonical_sha256":"c442c157cce08a456532f114b7bfd7763d9af1913312c39a613d2e2b9f122337","source":{"kind":"arxiv","id":"1810.08256","version":1},"attestation_state":"computed","paper":{"title":"Global Defensive Alliances in the Lexicographic Product of Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leila R. S. da Silva, Mitre C. Dourado, Rommel M. Barbosa","submitted_at":"2018-10-18T19:36:54Z","abstract_excerpt":"A set $S$ of vertices of graph $G$ is a \\textit{defensive alliance} of $G$ if for every $v \\in S$, it holds $|N[v] \\cap S| \\geq |N[v]-S|$. An alliance $S$ is called $global$ if it is also a dominating set. In this paper, we determine the exact values of the global defensive alliance number of lexicographic products of path and cycles."},"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":"1810.08256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-18T19:36:54Z","cross_cats_sorted":[],"title_canon_sha256":"6cf6fbe6b1829ceb3d4fb1da91520f13b3a09bce7f22dcb730cb6f31cf81d93a","abstract_canon_sha256":"20ce3882136b2db66a998744ee38f14efdfa9d5ec2d31f9ae8b70531b4d0fe6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:48.659828Z","signature_b64":"lGXNrUI1fp9+vKIZmmz96S4sxle8FuOGPUZZetBnIAK68H0OJ8b5Nb1QKM2NgktIYCjemvmC6HudSfrNTwKzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c442c157cce08a456532f114b7bfd7763d9af1913312c39a613d2e2b9f122337","last_reissued_at":"2026-05-18T00:02:48.659381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:48.659381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Global Defensive Alliances in the Lexicographic Product of Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Leila R. S. da Silva, Mitre C. Dourado, Rommel M. Barbosa","submitted_at":"2018-10-18T19:36:54Z","abstract_excerpt":"A set $S$ of vertices of graph $G$ is a \\textit{defensive alliance} of $G$ if for every $v \\in S$, it holds $|N[v] \\cap S| \\geq |N[v]-S|$. An alliance $S$ is called $global$ if it is also a dominating set. In this paper, we determine the exact values of the global defensive alliance number of lexicographic products of path and cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08256","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":"1810.08256","created_at":"2026-05-18T00:02:48.659448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08256v1","created_at":"2026-05-18T00:02:48.659448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08256","created_at":"2026-05-18T00:02:48.659448+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRBMCV6M4CFE","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRBMCV6M4CFEKZJS","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRBMCV6M","created_at":"2026-05-18T12:33:04.347982+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/YRBMCV6M4CFEKZJS6EKLPP6XOY","json":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY.json","graph_json":"https://pith.science/api/pith-number/YRBMCV6M4CFEKZJS6EKLPP6XOY/graph.json","events_json":"https://pith.science/api/pith-number/YRBMCV6M4CFEKZJS6EKLPP6XOY/events.json","paper":"https://pith.science/paper/YRBMCV6M"},"agent_actions":{"view_html":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY","download_json":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY.json","view_paper":"https://pith.science/paper/YRBMCV6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08256&json=true","fetch_graph":"https://pith.science/api/pith-number/YRBMCV6M4CFEKZJS6EKLPP6XOY/graph.json","fetch_events":"https://pith.science/api/pith-number/YRBMCV6M4CFEKZJS6EKLPP6XOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY/action/storage_attestation","attest_author":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY/action/author_attestation","sign_citation":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY/action/citation_signature","submit_replication":"https://pith.science/pith/YRBMCV6M4CFEKZJS6EKLPP6XOY/action/replication_record"}},"created_at":"2026-05-18T00:02:48.659448+00:00","updated_at":"2026-05-18T00:02:48.659448+00:00"}