{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IT4JD5K2SB6BYMM6I4JU4IN4PG","short_pith_number":"pith:IT4JD5K2","canonical_record":{"source":{"id":"1507.08654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T05:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"fff79f747e95fa5a7263c341a4ae8d27624d266827982f6432c33cec343fecc1","abstract_canon_sha256":"2a47669d4cdb879428385be967e9b6ed059ab5c00d59589680c09754c2c1acff"},"schema_version":"1.0"},"canonical_sha256":"44f891f55a907c1c319e47134e21bc79b53457d70c25c865b1310ef01d41c624","source":{"kind":"arxiv","id":"1507.08654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08654","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08654v1","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08654","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"IT4JD5K2SB6B","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IT4JD5K2SB6BYMM6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IT4JD5K2","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IT4JD5K2SB6BYMM6I4JU4IN4PG","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T05:30:48Z","cross_cats_sorted":[],"title_canon_sha256":"fff79f747e95fa5a7263c341a4ae8d27624d266827982f6432c33cec343fecc1","abstract_canon_sha256":"2a47669d4cdb879428385be967e9b6ed059ab5c00d59589680c09754c2c1acff"},"schema_version":"1.0"},"canonical_sha256":"44f891f55a907c1c319e47134e21bc79b53457d70c25c865b1310ef01d41c624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:03.216726Z","signature_b64":"4wTWeeKkwhtnvdD0vmCYYGssMFJR7lDbBE2eeTxlZ2ETP0gir4Poxhcn/s6bxxv1rtwfIE/2x3UtHNxI5sFjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f891f55a907c1c319e47134e21bc79b53457d70c25c865b1310ef01d41c624","last_reissued_at":"2026-05-18T01:36:03.216165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:03.216165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08654","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-18T01:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQDgstGne5gnAAj2lrOs5ay4PNrDXpGA2yvc16p0/RClhH0paVBFuN0FJ6Il4QxjMWsv1QK31IYEQR3HPBSJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:44.046718Z"},"content_sha256":"07c6c7b6c7c46ab291be7912978e91b1def96dbe6784c405b7ab1edd8dd336f5","schema_version":"1.0","event_id":"sha256:07c6c7b6c7c46ab291be7912978e91b1def96dbe6784c405b7ab1edd8dd336f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IT4JD5K2SB6BYMM6I4JU4IN4PG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the strong alliance polynomial of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Juan Carlos Hernandez-Gomez, Omar Rosario, Walter Carballosa, Yadira Torres-Nunez","submitted_at":"2015-07-30T05:30:48Z","abstract_excerpt":"We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):=\\sum_{i=a(G)}^{n}\\, a_i(G)\\ x^i$, where $a_{k}(G)$ is the number of strong defensive alliances with cardinality $k$ in $G$. We obtain some properties of $a(G; x)$ and its coefficients. In particular, we compute strong alliance polynomial for path, cycle, complete, start, complete bipartite and double star graphs; some of them verify unimodality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08654","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-18T01:36:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnztS8ocHufRmia32uwQkK7fLvhnnAuXYL/Paf+Jpt9AepK07dpplL1n93zJb0wYLnWiXvJdjfHpC/G+rbG9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:44.047059Z"},"content_sha256":"fd91f33710a414e52e08a6e565ec81c68ef9a62053a9c847579104837bbd135c","schema_version":"1.0","event_id":"sha256:fd91f33710a414e52e08a6e565ec81c68ef9a62053a9c847579104837bbd135c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG/bundle.json","state_url":"https://pith.science/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG/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-03T02:41:44Z","links":{"resolver":"https://pith.science/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG","bundle":"https://pith.science/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG/bundle.json","state":"https://pith.science/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT4JD5K2SB6BYMM6I4JU4IN4PG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IT4JD5K2SB6BYMM6I4JU4IN4PG","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":"2a47669d4cdb879428385be967e9b6ed059ab5c00d59589680c09754c2c1acff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T05:30:48Z","title_canon_sha256":"fff79f747e95fa5a7263c341a4ae8d27624d266827982f6432c33cec343fecc1"},"schema_version":"1.0","source":{"id":"1507.08654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08654","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08654v1","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08654","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"IT4JD5K2SB6B","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IT4JD5K2SB6BYMM6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IT4JD5K2","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:fd91f33710a414e52e08a6e565ec81c68ef9a62053a9c847579104837bbd135c","target":"graph","created_at":"2026-05-18T01:36:03Z","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":"We introduce the strong alliance polynomial of a graph. The strong alliance polynomial of a graph $G$ with order n and strong defensive alliance number $a(G)$ is the polynomial $a(G;x):=\\sum_{i=a(G)}^{n}\\, a_i(G)\\ x^i$, where $a_{k}(G)$ is the number of strong defensive alliances with cardinality $k$ in $G$. We obtain some properties of $a(G; x)$ and its coefficients. In particular, we compute strong alliance polynomial for path, cycle, complete, start, complete bipartite and double star graphs; some of them verify unimodality.","authors_text":"Juan Carlos Hernandez-Gomez, Omar Rosario, Walter Carballosa, Yadira Torres-Nunez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T05:30:48Z","title":"Computing the strong alliance polynomial of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08654","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:07c6c7b6c7c46ab291be7912978e91b1def96dbe6784c405b7ab1edd8dd336f5","target":"record","created_at":"2026-05-18T01:36:03Z","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":"2a47669d4cdb879428385be967e9b6ed059ab5c00d59589680c09754c2c1acff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-30T05:30:48Z","title_canon_sha256":"fff79f747e95fa5a7263c341a4ae8d27624d266827982f6432c33cec343fecc1"},"schema_version":"1.0","source":{"id":"1507.08654","kind":"arxiv","version":1}},"canonical_sha256":"44f891f55a907c1c319e47134e21bc79b53457d70c25c865b1310ef01d41c624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f891f55a907c1c319e47134e21bc79b53457d70c25c865b1310ef01d41c624","first_computed_at":"2026-05-18T01:36:03.216165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:03.216165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4wTWeeKkwhtnvdD0vmCYYGssMFJR7lDbBE2eeTxlZ2ETP0gir4Poxhcn/s6bxxv1rtwfIE/2x3UtHNxI5sFjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:03.216726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07c6c7b6c7c46ab291be7912978e91b1def96dbe6784c405b7ab1edd8dd336f5","sha256:fd91f33710a414e52e08a6e565ec81c68ef9a62053a9c847579104837bbd135c"],"state_sha256":"a65e8e3c95959b940ed29c5eed744b9cef6aa789e5c8ef0ac929d627939d735c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9wuQ8l8QcAHNZqMlItnjiFrcbXBu51hfqnmEG3Gjbd8aKfm7KZetBQ0P9R0aQN4LQtyn2MqG8F9Wmy0UPs+8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:41:44.049011Z","bundle_sha256":"9b73d2b8601b385042637ab0c5976a40dbb4d41e4b361702143f088397c1b8e7"}}