{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XNVQ3WE5TILJNGNG7YPIGJ5N3U","short_pith_number":"pith:XNVQ3WE5","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"},"canonical_sha256":"bb6b0dd89d9a169699a6fe1e8327addd1a39a4ca5fbb6e3ada89b6f428207dc1","source":{"kind":"arxiv","id":"1308.2096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2096","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2096v1","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2096","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"XNVQ3WE5TILJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XNVQ3WE5TILJNGNG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XNVQ3WE5","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XNVQ3WE5TILJNGNG7YPIGJ5N3U","target":"record","payload":{"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"},"canonical_sha256":"bb6b0dd89d9a169699a6fe1e8327addd1a39a4ca5fbb6e3ada89b6f428207dc1","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"},"source_kind":"arxiv","source_id":"1308.2096","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tjg23KK7VVEYS5COXS7/3tRR2vobSsMyBCuRb7UYJp2WVbBhKBIivekDUNl2lucH5bApqUlLWonrx3e3L4GDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:39:22.299101Z"},"content_sha256":"588e3915f552f9058b5527131e74b14d823f6a410d77f59c7b292efec5884ffa","schema_version":"1.0","event_id":"sha256:588e3915f552f9058b5527131e74b14d823f6a410d77f59c7b292efec5884ffa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XNVQ3WE5TILJNGNG7YPIGJ5N3U","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJicztw8BmDejcoZmHoDz7oDraHqMtwO9xbss9blttv9GBgO4DypVx8bnMrSVOr62OrR6kG3d3e0ewjx0tUyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:39:22.299468Z"},"content_sha256":"9da756dc030286c2e1afae0adc7668cd37032edec30591d957ce8d102edc5923","schema_version":"1.0","event_id":"sha256:9da756dc030286c2e1afae0adc7668cd37032edec30591d957ce8d102edc5923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/bundle.json","state_url":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T13:39:22Z","links":{"resolver":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U","bundle":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/bundle.json","state":"https://pith.science/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNVQ3WE5TILJNGNG7YPIGJ5N3U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XNVQ3WE5TILJNGNG7YPIGJ5N3U","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"01fb7569d41cee12666f348b3c27d854ba7953a8d2e7d1a5308a498fc58f4347","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-09T11:47:56Z","title_canon_sha256":"72610702c85c2535db3a8a7d1513fecdda459f684620e6bd9ec9d4e536854864"},"schema_version":"1.0","source":{"id":"1308.2096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.2096","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1308.2096v1","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.2096","created_at":"2026-05-18T03:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"XNVQ3WE5TILJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XNVQ3WE5TILJNGNG","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XNVQ3WE5","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:9da756dc030286c2e1afae0adc7668cd37032edec30591d957ce8d102edc5923","target":"graph","created_at":"2026-05-18T03:16:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ismael Gonz\\'alez Yero, Juan A. Rodr\\'iguez-Vel\\'azquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-09T11:47:56Z","title":"Defensive alliances in graphs: a survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.2096","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:588e3915f552f9058b5527131e74b14d823f6a410d77f59c7b292efec5884ffa","target":"record","created_at":"2026-05-18T03:16:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"01fb7569d41cee12666f348b3c27d854ba7953a8d2e7d1a5308a498fc58f4347","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-09T11:47:56Z","title_canon_sha256":"72610702c85c2535db3a8a7d1513fecdda459f684620e6bd9ec9d4e536854864"},"schema_version":"1.0","source":{"id":"1308.2096","kind":"arxiv","version":1}},"canonical_sha256":"bb6b0dd89d9a169699a6fe1e8327addd1a39a4ca5fbb6e3ada89b6f428207dc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb6b0dd89d9a169699a6fe1e8327addd1a39a4ca5fbb6e3ada89b6f428207dc1","first_computed_at":"2026-05-18T03:16:18.267582Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:18.267582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n0D17dh0sAyw6eKU57W2bFNliou+ANKeLnBg3wX8vDh+VSxg4o4Hb2qVgK6ZIVS/Trpfxw0Iym5BxUYRE/d0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:18.268040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.2096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:588e3915f552f9058b5527131e74b14d823f6a410d77f59c7b292efec5884ffa","sha256:9da756dc030286c2e1afae0adc7668cd37032edec30591d957ce8d102edc5923"],"state_sha256":"498ddc4e74d94c05fd24649e0a71dfdb0d7db2f4243181bdd12864dc3eebeb99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z8DvoyEFNibOcII8LA4ARDBy1ntG0Yi2iGclAXexooi8TWiZgl9R4Dk3tghAnZJOpTX+83BkgJDnt7lUgGZfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T13:39:22.301585Z","bundle_sha256":"23a6d7ef8505ca8505aaae90b4bde467df34faaa8d32ce7ab9a1a37a74036ae8"}}