{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:YLFXY65XH5T5NK5EP5ZM5VDBEH","short_pith_number":"pith:YLFXY65X","schema_version":"1.0","canonical_sha256":"c2cb7c7bb73f67d6aba47f72ced46121f8d701c0fce0576ef107e4b1344b9d47","source":{"kind":"arxiv","id":"math/0610023","version":1},"attestation_state":"computed","paper":{"title":"Offensive alliances in cubic graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. A. Rodriguez, J. M. Sigarreta","submitted_at":"2006-09-30T15:23:39Z","abstract_excerpt":"An offensive alliance in a graph $\\Gamma=(V,E)$ is a set of vertices $S\\subset V$ where for every vertex $v$ in its boundary it holds that the majority of vertices in $v$'s closed neighborhood are in $S$. In the case of strong offensive alliance, strict majority is required. An alliance $S$ is called global if it affects every vertex in $V\\backslash S$, that is, $S$ is a dominating set of $\\Gamma$. The global offensive alliance number $\\gamma_o(\\Gamma)$ (respectively, global strong offensive alliance number $\\gamma_{\\hat{o}}(\\Gamma)$) is the minimum cardinality of a global offensive (respectiv"},"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":"math/0610023","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-09-30T15:23:39Z","cross_cats_sorted":[],"title_canon_sha256":"ed4aa97432519469a4a3b47443c295cb8b9ee4692c2b5a3de9abd8b6e9a1b4ce","abstract_canon_sha256":"2e7609cd40092071399441bd1765df284b348356960bf0ecc6aa8fb086522f3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:15.099481Z","signature_b64":"iBkBHiPUjVoUHsXMvKOpsrT9y6sjL1bpu2geCGX5FyOaXMBA8fw+KhGP765MF/0BD3e/a7PqsgtkQgSejpkqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2cb7c7bb73f67d6aba47f72ced46121f8d701c0fce0576ef107e4b1344b9d47","last_reissued_at":"2026-05-18T03:00:15.098567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:15.098567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Offensive alliances in cubic graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. A. Rodriguez, J. M. Sigarreta","submitted_at":"2006-09-30T15:23:39Z","abstract_excerpt":"An offensive alliance in a graph $\\Gamma=(V,E)$ is a set of vertices $S\\subset V$ where for every vertex $v$ in its boundary it holds that the majority of vertices in $v$'s closed neighborhood are in $S$. In the case of strong offensive alliance, strict majority is required. An alliance $S$ is called global if it affects every vertex in $V\\backslash S$, that is, $S$ is a dominating set of $\\Gamma$. The global offensive alliance number $\\gamma_o(\\Gamma)$ (respectively, global strong offensive alliance number $\\gamma_{\\hat{o}}(\\Gamma)$) is the minimum cardinality of a global offensive (respectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610023","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":"math/0610023","created_at":"2026-05-18T03:00:15.098723+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0610023v1","created_at":"2026-05-18T03:00:15.098723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610023","created_at":"2026-05-18T03:00:15.098723+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLFXY65XH5T5","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLFXY65XH5T5NK5E","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLFXY65X","created_at":"2026-05-18T12:25:54.717736+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/YLFXY65XH5T5NK5EP5ZM5VDBEH","json":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH.json","graph_json":"https://pith.science/api/pith-number/YLFXY65XH5T5NK5EP5ZM5VDBEH/graph.json","events_json":"https://pith.science/api/pith-number/YLFXY65XH5T5NK5EP5ZM5VDBEH/events.json","paper":"https://pith.science/paper/YLFXY65X"},"agent_actions":{"view_html":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH","download_json":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH.json","view_paper":"https://pith.science/paper/YLFXY65X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0610023&json=true","fetch_graph":"https://pith.science/api/pith-number/YLFXY65XH5T5NK5EP5ZM5VDBEH/graph.json","fetch_events":"https://pith.science/api/pith-number/YLFXY65XH5T5NK5EP5ZM5VDBEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH/action/storage_attestation","attest_author":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH/action/author_attestation","sign_citation":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH/action/citation_signature","submit_replication":"https://pith.science/pith/YLFXY65XH5T5NK5EP5ZM5VDBEH/action/replication_record"}},"created_at":"2026-05-18T03:00:15.098723+00:00","updated_at":"2026-05-18T03:00:15.098723+00:00"}