{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MDOFMI6VE6JTOH6QYXYQGZJAK5","short_pith_number":"pith:MDOFMI6V","schema_version":"1.0","canonical_sha256":"60dc5623d52793371fd0c5f103652057493689cb5326779cae00cc13f13dfb5e","source":{"kind":"arxiv","id":"1204.0494","version":2},"attestation_state":"computed","paper":{"title":"Computing global offensive alliances in Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2012-04-02T18:46:57Z","abstract_excerpt":"A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The global offensive alliance number of $G$, $\\gamma_o(G)$, is the minimum cardinality of a global offensive alliance in $G$. A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex not belonging to $S$ has at least one neighbor in $S$. The domination number of $G$, $\\gamma(G)$, is the minimum cardinality of a dominating set of $G$. In this work we obtain closed formulas for the gl"},"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":"1204.0494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T18:46:57Z","cross_cats_sorted":[],"title_canon_sha256":"7438641cd6e260b16054ffa65cdd19746d80321e5167b3243929d789156730a9","abstract_canon_sha256":"0c79f023edf6aa9e5cd33461b73d268e93038aa028cb71cd0e3d079438bfa964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:10.619865Z","signature_b64":"UNeUr6GLOK9nUyCqffxTqWc6GLkTolYlUy5vbcv+9umbN3LB/1+YuxULlbWuOFWZkmlt1hOiKR0G3xtOCUg4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60dc5623d52793371fd0c5f103652057493689cb5326779cae00cc13f13dfb5e","last_reissued_at":"2026-05-18T03:50:10.619307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:10.619307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing global offensive alliances in Cartesian product graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael G. Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2012-04-02T18:46:57Z","abstract_excerpt":"A global offensive alliance in a graph $G$ is a set $S$ of vertices with the property that every vertex not belonging to $S$ has at least one more neighbor in $S$ than it has outside of $S$. The global offensive alliance number of $G$, $\\gamma_o(G)$, is the minimum cardinality of a global offensive alliance in $G$. A set $S$ of vertices of a graph $G$ is a dominating set for $G$ if every vertex not belonging to $S$ has at least one neighbor in $S$. The domination number of $G$, $\\gamma(G)$, is the minimum cardinality of a dominating set of $G$. In this work we obtain closed formulas for the gl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0494","kind":"arxiv","version":2},"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":"1204.0494","created_at":"2026-05-18T03:50:10.619418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0494v2","created_at":"2026-05-18T03:50:10.619418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0494","created_at":"2026-05-18T03:50:10.619418+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDOFMI6VE6JT","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDOFMI6VE6JTOH6Q","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDOFMI6V","created_at":"2026-05-18T12:27:14.488303+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/MDOFMI6VE6JTOH6QYXYQGZJAK5","json":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5.json","graph_json":"https://pith.science/api/pith-number/MDOFMI6VE6JTOH6QYXYQGZJAK5/graph.json","events_json":"https://pith.science/api/pith-number/MDOFMI6VE6JTOH6QYXYQGZJAK5/events.json","paper":"https://pith.science/paper/MDOFMI6V"},"agent_actions":{"view_html":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5","download_json":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5.json","view_paper":"https://pith.science/paper/MDOFMI6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0494&json=true","fetch_graph":"https://pith.science/api/pith-number/MDOFMI6VE6JTOH6QYXYQGZJAK5/graph.json","fetch_events":"https://pith.science/api/pith-number/MDOFMI6VE6JTOH6QYXYQGZJAK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5/action/storage_attestation","attest_author":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5/action/author_attestation","sign_citation":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5/action/citation_signature","submit_replication":"https://pith.science/pith/MDOFMI6VE6JTOH6QYXYQGZJAK5/action/replication_record"}},"created_at":"2026-05-18T03:50:10.619418+00:00","updated_at":"2026-05-18T03:50:10.619418+00:00"}