{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XNVQ3WE5TILJNGNG7YPIGJ5N3U","short_pith_number":"pith:XNVQ3WE5","schema_version":"1.0","canonical_sha256":"bb6b0dd89d9a169699a6fe1e8327addd1a39a4ca5fbb6e3ada89b6f428207dc1","source":{"kind":"arxiv","id":"1308.2096","version":1},"attestation_state":"computed","paper":{"title":"Defensive alliances in graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael Gonz\\'alez Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-08-09T11:47:56Z","abstract_excerpt":"A set $S$ of vertices of a graph $G$ is a defensive $k$-alliance in $G$ if every vertex of $S$ has at least $k$ more neighbors inside of $S$ than outside. This is primarily an expository article surveying the principal known results on defensive alliances in graph. Its seven sections are: Introduction, Computational complexity and realizability, Defensive $k$-alliance number, Boundary defensive $k$-alliances, Defensive alliances in Cartesian product graphs, Partitioning a graph into defensive $k$-alliances, and Defensive $k$-alliance free sets."},"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":"1308.2096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-09T11:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"72610702c85c2535db3a8a7d1513fecdda459f684620e6bd9ec9d4e536854864","abstract_canon_sha256":"01fb7569d41cee12666f348b3c27d854ba7953a8d2e7d1a5308a498fc58f4347"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:18.268040Z","signature_b64":"n0D17dh0sAyw6eKU57W2bFNliou+ANKeLnBg3wX8vDh+VSxg4o4Hb2qVgK6ZIVS/Trpfxw0Iym5BxUYRE/d0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb6b0dd89d9a169699a6fe1e8327addd1a39a4ca5fbb6e3ada89b6f428207dc1","last_reissued_at":"2026-05-18T03:16:18.267582Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:18.267582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defensive alliances in graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ismael Gonz\\'alez Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","submitted_at":"2013-08-09T11:47:56Z","abstract_excerpt":"A set $S$ of vertices of a graph $G$ is a defensive $k$-alliance in $G$ if every vertex of $S$ has at least $k$ more neighbors inside of $S$ than outside. This is primarily an expository article surveying the principal known results on defensive alliances in graph. Its seven sections are: Introduction, Computational complexity and realizability, Defensive $k$-alliance number, Boundary defensive $k$-alliances, Defensive alliances in Cartesian product graphs, Partitioning a graph into defensive $k$-alliances, and Defensive $k$-alliance free sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2096","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":"1308.2096","created_at":"2026-05-18T03:16:18.267645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.2096v1","created_at":"2026-05-18T03:16:18.267645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2096","created_at":"2026-05-18T03:16:18.267645+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNVQ3WE5TILJ","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNVQ3WE5TILJNGNG","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNVQ3WE5","created_at":"2026-05-18T12:28:06.772260+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/XNVQ3WE5TILJNGNG7YPIGJ5N3U","json":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U.json","graph_json":"https://pith.science/api/pith-number/XNVQ3WE5TILJNGNG7YPIGJ5N3U/graph.json","events_json":"https://pith.science/api/pith-number/XNVQ3WE5TILJNGNG7YPIGJ5N3U/events.json","paper":"https://pith.science/paper/XNVQ3WE5"},"agent_actions":{"view_html":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U","download_json":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U.json","view_paper":"https://pith.science/paper/XNVQ3WE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.2096&json=true","fetch_graph":"https://pith.science/api/pith-number/XNVQ3WE5TILJNGNG7YPIGJ5N3U/graph.json","fetch_events":"https://pith.science/api/pith-number/XNVQ3WE5TILJNGNG7YPIGJ5N3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/action/storage_attestation","attest_author":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/action/author_attestation","sign_citation":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/action/citation_signature","submit_replication":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/action/replication_record"}},"created_at":"2026-05-18T03:16:18.267645+00:00","updated_at":"2026-05-18T03:16:18.267645+00:00"}