{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:37VPV2GJVTJ73WIG4TYSNCLSOJ","short_pith_number":"pith:37VPV2GJ","schema_version":"1.0","canonical_sha256":"dfeafae8c9acd3fdd906e4f126897272545b4eb8d7479ec0583cd869a79015e3","source":{"kind":"arxiv","id":"math/0602428","version":2},"attestation_state":"computed","paper":{"title":"Alliance free and alliance cover sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. G. Yero, J. A. Rodriguez-Velazquez, J. M. Sigarreta, S. Bermudo","submitted_at":"2006-02-20T14:15:55Z","abstract_excerpt":"A \\emph{defensive} (\\emph{offensive}) $k$-\\emph{alliance} in $\\Gamma=(V,E)$ is a set $S\\subseteq V$ such that every $v$ in $S$ (in the boundary of $S$) has at least $k$ more neighbors in $S$ than it has in $V\\setminus S$. A set $X\\subseteq V$ is \\emph{defensive} (\\emph{offensive}) $k$-\\emph{alliance free,} if for all defensive (offensive) $k$-alliance $S$, $S\\setminus X\\neq\\emptyset$, i.e., $X$ does not contain any defensive (offensive) $k$-alliance as a subset. A set $Y \\subseteq V$ is a \\emph{defensive} (\\emph{offensive}) $k$-\\emph{alliance cover}, if for all defensive (offensive) $k$-allian"},"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/0602428","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-02-20T14:15:55Z","cross_cats_sorted":[],"title_canon_sha256":"ad60fc2b11a20916bb1706aee776f95a8e83e1da60c70472026e9fe2d9fd5d39","abstract_canon_sha256":"6229befc4b9b79337f474547a73297fee031da08d22210a8a8b00969800d9a20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.561524Z","signature_b64":"IOoRnmND9MsiYBxPmD71f+yp65aaFIwSMj4XPnQ3kjLRYYYZ9jPY/+ISRsgkhOxWs6Z4Juc04QAw/BCIzQaACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfeafae8c9acd3fdd906e4f126897272545b4eb8d7479ec0583cd869a79015e3","last_reissued_at":"2026-05-18T03:05:55.560906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.560906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alliance free and alliance cover sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"I. G. Yero, J. A. Rodriguez-Velazquez, J. M. Sigarreta, S. Bermudo","submitted_at":"2006-02-20T14:15:55Z","abstract_excerpt":"A \\emph{defensive} (\\emph{offensive}) $k$-\\emph{alliance} in $\\Gamma=(V,E)$ is a set $S\\subseteq V$ such that every $v$ in $S$ (in the boundary of $S$) has at least $k$ more neighbors in $S$ than it has in $V\\setminus S$. A set $X\\subseteq V$ is \\emph{defensive} (\\emph{offensive}) $k$-\\emph{alliance free,} if for all defensive (offensive) $k$-alliance $S$, $S\\setminus X\\neq\\emptyset$, i.e., $X$ does not contain any defensive (offensive) $k$-alliance as a subset. A set $Y \\subseteq V$ is a \\emph{defensive} (\\emph{offensive}) $k$-\\emph{alliance cover}, if for all defensive (offensive) $k$-allian"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602428","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":"math/0602428","created_at":"2026-05-18T03:05:55.560993+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0602428v2","created_at":"2026-05-18T03:05:55.560993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602428","created_at":"2026-05-18T03:05:55.560993+00:00"},{"alias_kind":"pith_short_12","alias_value":"37VPV2GJVTJ7","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"37VPV2GJVTJ73WIG","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"37VPV2GJ","created_at":"2026-05-18T12:25:53.939244+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/37VPV2GJVTJ73WIG4TYSNCLSOJ","json":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ.json","graph_json":"https://pith.science/api/pith-number/37VPV2GJVTJ73WIG4TYSNCLSOJ/graph.json","events_json":"https://pith.science/api/pith-number/37VPV2GJVTJ73WIG4TYSNCLSOJ/events.json","paper":"https://pith.science/paper/37VPV2GJ"},"agent_actions":{"view_html":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ","download_json":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ.json","view_paper":"https://pith.science/paper/37VPV2GJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0602428&json=true","fetch_graph":"https://pith.science/api/pith-number/37VPV2GJVTJ73WIG4TYSNCLSOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/37VPV2GJVTJ73WIG4TYSNCLSOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ/action/storage_attestation","attest_author":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ/action/author_attestation","sign_citation":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ/action/citation_signature","submit_replication":"https://pith.science/pith/37VPV2GJVTJ73WIG4TYSNCLSOJ/action/replication_record"}},"created_at":"2026-05-18T03:05:55.560993+00:00","updated_at":"2026-05-18T03:05:55.560993+00:00"}