{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BEU6J7JO6AIXCSPZJHBW7PVP5O","short_pith_number":"pith:BEU6J7JO","canonical_record":{"source":{"id":"1309.7673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-29T23:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"b82cc0b015461f18c9852f31908808d14d224dbacaeadd3a1c46fbd9346a8110","abstract_canon_sha256":"d20cd4cde8324b6686c29a4f8b2745d49b6df9c17a7f31a8e93b8b946e8bc02b"},"schema_version":"1.0"},"canonical_sha256":"0929e4fd2ef0117149f949c36fbeafebb3b36cf658fb9beef869a2e0017b5456","source":{"kind":"arxiv","id":"1309.7673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7673","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7673v1","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7673","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"BEU6J7JO6AIX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BEU6J7JO6AIXCSPZ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BEU6J7JO","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BEU6J7JO6AIXCSPZJHBW7PVP5O","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-29T23:00:43Z","cross_cats_sorted":[],"title_canon_sha256":"b82cc0b015461f18c9852f31908808d14d224dbacaeadd3a1c46fbd9346a8110","abstract_canon_sha256":"d20cd4cde8324b6686c29a4f8b2745d49b6df9c17a7f31a8e93b8b946e8bc02b"},"schema_version":"1.0"},"canonical_sha256":"0929e4fd2ef0117149f949c36fbeafebb3b36cf658fb9beef869a2e0017b5456","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:48.763718Z","signature_b64":"LOIIcn1gf1537fwpA4J9/E13aNyU0FBYpybnnKwWli3ODfWwPCgCoYEG4sKDzfmDUtkAoY7fhtajuW2xFhuXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0929e4fd2ef0117149f949c36fbeafebb3b36cf658fb9beef869a2e0017b5456","last_reissued_at":"2026-05-18T03:11:48.763239Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:48.763239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7673","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:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2oxKW4cIFXnLHIZb2lr000Deg04qrblxJ8YK4nU3nYKNvBU/6HyhFVlSBBeOURaIVesnF5xL/K0kuHK+QspAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:19.432078Z"},"content_sha256":"9e9c9d88cd49bf347139df05c7527fce72c1dcaed611c9d0c5c0234177334033","schema_version":"1.0","event_id":"sha256:9e9c9d88cd49bf347139df05c7527fce72c1dcaed611c9d0c5c0234177334033"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BEU6J7JO6AIXCSPZJHBW7PVP5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Operations of graphs and unimodality of independence polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bao-Xuan Zhu","submitted_at":"2013-09-29T23:00:43Z","abstract_excerpt":"Given two graphs $G$ and $H$, assume that $\\mathscr{C}=\\{C_1,C_2,\\ldots, C_q\\}$ is a clique cover of $G$ and $U$ is a subset of $V(H)$. We introduce a new graph operation called the clique cover product, denoted by $G^{\\mathscr{C}}\\star H^U$, as follows: for each clique $C_i\\in \\mathscr{C}$, add a copy of the graph $H$ and join every vertex of $C_i$ to every vertex of $U$. We prove that the independence polynomial of $G^{\\mathscr{C}}\\star H^U$ $$I(G^{\\mathscr{C}}\\star H^U;x)=I^q(H;x)I(G;\\frac{xI(H-U;x)}{I(H;x)}),$$ which generalizes some known results on independence polynomials of corona and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7673","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:11:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKu70MIaO+PhB9+6J/0pKlYo8iV8xolG5fHO4KGYxzNOMn7+f0s6I0v9mxYM7NOgm2M/3530i4hExHahgNK6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:19.432473Z"},"content_sha256":"8a4510482c41d700dc8ee0cbb34e81b090f6f34211193876112e5640af93812b","schema_version":"1.0","event_id":"sha256:8a4510482c41d700dc8ee0cbb34e81b090f6f34211193876112e5640af93812b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O/bundle.json","state_url":"https://pith.science/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O/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-04T20:27:19Z","links":{"resolver":"https://pith.science/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O","bundle":"https://pith.science/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O/bundle.json","state":"https://pith.science/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEU6J7JO6AIXCSPZJHBW7PVP5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BEU6J7JO6AIXCSPZJHBW7PVP5O","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":"d20cd4cde8324b6686c29a4f8b2745d49b6df9c17a7f31a8e93b8b946e8bc02b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-29T23:00:43Z","title_canon_sha256":"b82cc0b015461f18c9852f31908808d14d224dbacaeadd3a1c46fbd9346a8110"},"schema_version":"1.0","source":{"id":"1309.7673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7673","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7673v1","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7673","created_at":"2026-05-18T03:11:48Z"},{"alias_kind":"pith_short_12","alias_value":"BEU6J7JO6AIX","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"BEU6J7JO6AIXCSPZ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"BEU6J7JO","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:8a4510482c41d700dc8ee0cbb34e81b090f6f34211193876112e5640af93812b","target":"graph","created_at":"2026-05-18T03:11:48Z","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":"Given two graphs $G$ and $H$, assume that $\\mathscr{C}=\\{C_1,C_2,\\ldots, C_q\\}$ is a clique cover of $G$ and $U$ is a subset of $V(H)$. We introduce a new graph operation called the clique cover product, denoted by $G^{\\mathscr{C}}\\star H^U$, as follows: for each clique $C_i\\in \\mathscr{C}$, add a copy of the graph $H$ and join every vertex of $C_i$ to every vertex of $U$. We prove that the independence polynomial of $G^{\\mathscr{C}}\\star H^U$ $$I(G^{\\mathscr{C}}\\star H^U;x)=I^q(H;x)I(G;\\frac{xI(H-U;x)}{I(H;x)}),$$ which generalizes some known results on independence polynomials of corona and ","authors_text":"Bao-Xuan Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-29T23:00:43Z","title":"Operations of graphs and unimodality of independence polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7673","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:9e9c9d88cd49bf347139df05c7527fce72c1dcaed611c9d0c5c0234177334033","target":"record","created_at":"2026-05-18T03:11:48Z","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":"d20cd4cde8324b6686c29a4f8b2745d49b6df9c17a7f31a8e93b8b946e8bc02b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-29T23:00:43Z","title_canon_sha256":"b82cc0b015461f18c9852f31908808d14d224dbacaeadd3a1c46fbd9346a8110"},"schema_version":"1.0","source":{"id":"1309.7673","kind":"arxiv","version":1}},"canonical_sha256":"0929e4fd2ef0117149f949c36fbeafebb3b36cf658fb9beef869a2e0017b5456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0929e4fd2ef0117149f949c36fbeafebb3b36cf658fb9beef869a2e0017b5456","first_computed_at":"2026-05-18T03:11:48.763239Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:48.763239Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOIIcn1gf1537fwpA4J9/E13aNyU0FBYpybnnKwWli3ODfWwPCgCoYEG4sKDzfmDUtkAoY7fhtajuW2xFhuXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:48.763718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e9c9d88cd49bf347139df05c7527fce72c1dcaed611c9d0c5c0234177334033","sha256:8a4510482c41d700dc8ee0cbb34e81b090f6f34211193876112e5640af93812b"],"state_sha256":"bb5ee88249070def973fa9742b8174618cea44e064a0a7e0267e6586d8851481"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txt+iRPbGer4sbSAA8Z8+5jlzfXxy24+hmpPONJCr8KN869pg2lzsFgHC7gHAEdH16QNci5tY9L/SBgkE0QtBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:27:19.434379Z","bundle_sha256":"b4c23bf61d6375b2b496ea55468552cf9c9049e0d5b15b55f5e06045e4e96f49"}}