{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PJQJVDYLU63DL7WN32ZIO3Q3DQ","short_pith_number":"pith:PJQJVDYL","canonical_record":{"source":{"id":"1808.07369","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-21T15:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"0e111b69117845f3d29f6b6a0b8c6a5bc62781661fc53c163bb904b57a075f21","abstract_canon_sha256":"86ca372c7feae003dfe1745478a32b6ca7bc086c62f57722769a162985321288"},"schema_version":"1.0"},"canonical_sha256":"7a609a8f0ba7b635fecddeb2876e1b1c3c9ab29d90f80e846bf9366c43213c14","source":{"kind":"arxiv","id":"1808.07369","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07369","created_at":"2026-05-17T23:58:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07369v3","created_at":"2026-05-17T23:58:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07369","created_at":"2026-05-17T23:58:52Z"},{"alias_kind":"pith_short_12","alias_value":"PJQJVDYLU63D","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJQJVDYLU63DL7WN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJQJVDYL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PJQJVDYLU63DL7WN32ZIO3Q3DQ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.07369","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-21T15:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"0e111b69117845f3d29f6b6a0b8c6a5bc62781661fc53c163bb904b57a075f21","abstract_canon_sha256":"86ca372c7feae003dfe1745478a32b6ca7bc086c62f57722769a162985321288"},"schema_version":"1.0"},"canonical_sha256":"7a609a8f0ba7b635fecddeb2876e1b1c3c9ab29d90f80e846bf9366c43213c14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:52.562597Z","signature_b64":"jIHpsg9RVWkZgR0XQzFVG+EXG4rlRy4vhBXmIqlqfjqyVNybJPCO7WcKu/5AjnaupFSmx/D9S43UXAGK9EMqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a609a8f0ba7b635fecddeb2876e1b1c3c9ab29d90f80e846bf9366c43213c14","last_reissued_at":"2026-05-17T23:58:52.561844Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:52.561844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.07369","source_version":3,"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-17T23:58:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4kBPxhRCWS//4TU6LGZtw2ihaQbqKm0o6WRuAlD7z9JbwXmez61jLGfONM2Y76azsUxpqLfml4cKmvyycZCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:08:02.339337Z"},"content_sha256":"6f7d2d833e3607ac4e25f879dbcabad21ba108e7bef6768bc4bff4e75fa45a74","schema_version":"1.0","event_id":"sha256:6f7d2d833e3607ac4e25f879dbcabad21ba108e7bef6768bc4bff4e75fa45a74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PJQJVDYLU63DL7WN32ZIO3Q3DQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the independent domination polynomial of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Saeid Alikhani, Somayeh Jahari","submitted_at":"2018-08-21T15:03:36Z","abstract_excerpt":"An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\\sum_{A} x^{|A|}$, summed over all independent dominating subsets $A\\subseteq V$. A root of $D_i(G,x)$ is called an independence domination root. We investigate the independent domination polynomials of some generalized compound graphs. As consequences, we construct graphs whose independence domination roots are real. Also, we consider some certain graphs and study the number of their inde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07369","kind":"arxiv","version":3},"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-17T23:58:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"io4zAqRc/cE+6CZ7jaTJFeLhKg4lVehiRIqy2z0wEHXZWcBJ1Diz/8N8bJ0GFUcbkJmu4UyczJ7HYMTx3KrzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:08:02.339684Z"},"content_sha256":"ebef636c125be8f9a8fc27365d7ce917f818b004cb8b01b0fa8d1c976ba3b8d7","schema_version":"1.0","event_id":"sha256:ebef636c125be8f9a8fc27365d7ce917f818b004cb8b01b0fa8d1c976ba3b8d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ/bundle.json","state_url":"https://pith.science/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ/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-24T08:08:02Z","links":{"resolver":"https://pith.science/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ","bundle":"https://pith.science/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ/bundle.json","state":"https://pith.science/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJQJVDYLU63DL7WN32ZIO3Q3DQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PJQJVDYLU63DL7WN32ZIO3Q3DQ","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":"86ca372c7feae003dfe1745478a32b6ca7bc086c62f57722769a162985321288","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-21T15:03:36Z","title_canon_sha256":"0e111b69117845f3d29f6b6a0b8c6a5bc62781661fc53c163bb904b57a075f21"},"schema_version":"1.0","source":{"id":"1808.07369","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07369","created_at":"2026-05-17T23:58:52Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07369v3","created_at":"2026-05-17T23:58:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07369","created_at":"2026-05-17T23:58:52Z"},{"alias_kind":"pith_short_12","alias_value":"PJQJVDYLU63D","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJQJVDYLU63DL7WN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJQJVDYL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:ebef636c125be8f9a8fc27365d7ce917f818b004cb8b01b0fa8d1c976ba3b8d7","target":"graph","created_at":"2026-05-17T23:58:52Z","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":"An independent dominating set of the simple graph $G=(V,E)$ is a vertex subset that is both dominating and independent in $G$. The independent domination polynomial of a graph $G$ is the polynomial $D_i(G,x)=\\sum_{A} x^{|A|}$, summed over all independent dominating subsets $A\\subseteq V$. A root of $D_i(G,x)$ is called an independence domination root. We investigate the independent domination polynomials of some generalized compound graphs. As consequences, we construct graphs whose independence domination roots are real. Also, we consider some certain graphs and study the number of their inde","authors_text":"Saeid Alikhani, Somayeh Jahari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-21T15:03:36Z","title":"On the independent domination polynomial of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07369","kind":"arxiv","version":3},"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:6f7d2d833e3607ac4e25f879dbcabad21ba108e7bef6768bc4bff4e75fa45a74","target":"record","created_at":"2026-05-17T23:58:52Z","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":"86ca372c7feae003dfe1745478a32b6ca7bc086c62f57722769a162985321288","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-21T15:03:36Z","title_canon_sha256":"0e111b69117845f3d29f6b6a0b8c6a5bc62781661fc53c163bb904b57a075f21"},"schema_version":"1.0","source":{"id":"1808.07369","kind":"arxiv","version":3}},"canonical_sha256":"7a609a8f0ba7b635fecddeb2876e1b1c3c9ab29d90f80e846bf9366c43213c14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a609a8f0ba7b635fecddeb2876e1b1c3c9ab29d90f80e846bf9366c43213c14","first_computed_at":"2026-05-17T23:58:52.561844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:52.561844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIHpsg9RVWkZgR0XQzFVG+EXG4rlRy4vhBXmIqlqfjqyVNybJPCO7WcKu/5AjnaupFSmx/D9S43UXAGK9EMqCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:52.562597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07369","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f7d2d833e3607ac4e25f879dbcabad21ba108e7bef6768bc4bff4e75fa45a74","sha256:ebef636c125be8f9a8fc27365d7ce917f818b004cb8b01b0fa8d1c976ba3b8d7"],"state_sha256":"cf414808f3b2d870def6fe124cadc2fd5643a5ba26a2148c1a35cb5268b76b09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsgCyyyDuJdwsQyvkfZEPi5pyBdYSa2btpkWjxqUoyW0QkRi0wVJty2VzBVcZH3hsDfND+wxeKNTS4YfX3VdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:08:02.341608Z","bundle_sha256":"35e1186ef441269cc2af2133fb8b44aac2262928fd5ea1a6d2e42b1f3089c558"}}