{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D47DJEDJTYXFGPRX3FDYU6IYSB","short_pith_number":"pith:D47DJEDJ","canonical_record":{"source":{"id":"1507.05754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T09:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"6f8db99a6019e2201682333eef74bae3fe16301e3728490509ec22e46b2707f4","abstract_canon_sha256":"595d13a5d0f62e7eafb1aefb7fef4169dc4c239dc69e1a914565ceffc06005c4"},"schema_version":"1.0"},"canonical_sha256":"1f3e3490699e2e533e37d9478a79189067435ed1381bb49d71eb2e6539d49035","source":{"kind":"arxiv","id":"1507.05754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05754","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05754v1","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05754","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"pith_short_12","alias_value":"D47DJEDJTYXF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D47DJEDJTYXFGPRX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D47DJEDJ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D47DJEDJTYXFGPRX3FDYU6IYSB","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T09:11:15Z","cross_cats_sorted":[],"title_canon_sha256":"6f8db99a6019e2201682333eef74bae3fe16301e3728490509ec22e46b2707f4","abstract_canon_sha256":"595d13a5d0f62e7eafb1aefb7fef4169dc4c239dc69e1a914565ceffc06005c4"},"schema_version":"1.0"},"canonical_sha256":"1f3e3490699e2e533e37d9478a79189067435ed1381bb49d71eb2e6539d49035","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:32.575599Z","signature_b64":"THRC86yAS6Fdd8NQ4cEMPPpoM+tdDOA5AbMufc98BVrq9dbgDv2S6zJ9PjA1asz8xOkkzJh3MyCc0yHEnIH8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f3e3490699e2e533e37d9478a79189067435ed1381bb49d71eb2e6539d49035","last_reissued_at":"2026-05-18T01:36:32.574760Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:32.574760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05754","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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPfH2gORFmCLCaU6aK4mxhaeeLeCEp2P5CvPG/hPPFI1ftL0IuKyC7akZevFqxuUqx22xJYXEPFR5OHkt35qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:04:11.724102Z"},"content_sha256":"9a9e89b4cf524dfbe00c23354f1a7f3d5cef3d38a8448ce708bf0d4122035185","schema_version":"1.0","event_id":"sha256:9a9e89b4cf524dfbe00c23354f1a7f3d5cef3d38a8448ce708bf0d4122035185"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D47DJEDJTYXFGPRX3FDYU6IYSB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unimodality of the independence polynomials of some composite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bao-Xuan Zhu, Qinglin Lu","submitted_at":"2015-07-21T09:11:15Z","abstract_excerpt":"Let $I(G;x)$ denote the independence polynomial of a graph $G$. In this paper we study the unimodality properties of $I(G;x)$ for some composite graphs $G$.\n  Given two graphs $G_1$ and $G_2$, let $G_1[G_2]$ denote the lexicographic product of $G_1$ and $G_2$. Assume $I(G_1;x)=\\sum_{i\\geq0}a_ix^i$ and $I(G_2;x)=\\sum_{i\\geq0}b_ix^i$, where $I(G_2;x)$ is log-concave. Then we prove (i) if $I(G_1;x)$ is log-concave and $(a^2_i-a_{i-1}a_{i+1})b^2_1\\geq a_ia_{i-1}b_2$ for all $1\\leq i \\leq \\alpha(G_1)$, then $I(G_1[G_2];x)$ is log-concave; (ii) if $a_{i-1}\\leq b_1a_i$ for $1\\leq i\\leq \\alpha(G_1)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05754","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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdaUhUKRiYQOGgJOkWgM900z3zCxpfNrrqXTXUxdH7RLYhhmVFqFq69afJDAF5XQlPX99qsRqIho5ZVSpqeUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:04:11.724752Z"},"content_sha256":"50a04b68381a890158325ded5263f93f897b84963e83bfbd1517bcfecbfb1f21","schema_version":"1.0","event_id":"sha256:50a04b68381a890158325ded5263f93f897b84963e83bfbd1517bcfecbfb1f21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D47DJEDJTYXFGPRX3FDYU6IYSB/bundle.json","state_url":"https://pith.science/pith/D47DJEDJTYXFGPRX3FDYU6IYSB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D47DJEDJTYXFGPRX3FDYU6IYSB/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-05-30T05:04:11Z","links":{"resolver":"https://pith.science/pith/D47DJEDJTYXFGPRX3FDYU6IYSB","bundle":"https://pith.science/pith/D47DJEDJTYXFGPRX3FDYU6IYSB/bundle.json","state":"https://pith.science/pith/D47DJEDJTYXFGPRX3FDYU6IYSB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D47DJEDJTYXFGPRX3FDYU6IYSB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D47DJEDJTYXFGPRX3FDYU6IYSB","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":"595d13a5d0f62e7eafb1aefb7fef4169dc4c239dc69e1a914565ceffc06005c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T09:11:15Z","title_canon_sha256":"6f8db99a6019e2201682333eef74bae3fe16301e3728490509ec22e46b2707f4"},"schema_version":"1.0","source":{"id":"1507.05754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05754","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05754v1","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05754","created_at":"2026-05-18T01:36:32Z"},{"alias_kind":"pith_short_12","alias_value":"D47DJEDJTYXF","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D47DJEDJTYXFGPRX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D47DJEDJ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:50a04b68381a890158325ded5263f93f897b84963e83bfbd1517bcfecbfb1f21","target":"graph","created_at":"2026-05-18T01:36:32Z","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":"Let $I(G;x)$ denote the independence polynomial of a graph $G$. In this paper we study the unimodality properties of $I(G;x)$ for some composite graphs $G$.\n  Given two graphs $G_1$ and $G_2$, let $G_1[G_2]$ denote the lexicographic product of $G_1$ and $G_2$. Assume $I(G_1;x)=\\sum_{i\\geq0}a_ix^i$ and $I(G_2;x)=\\sum_{i\\geq0}b_ix^i$, where $I(G_2;x)$ is log-concave. Then we prove (i) if $I(G_1;x)$ is log-concave and $(a^2_i-a_{i-1}a_{i+1})b^2_1\\geq a_ia_{i-1}b_2$ for all $1\\leq i \\leq \\alpha(G_1)$, then $I(G_1[G_2];x)$ is log-concave; (ii) if $a_{i-1}\\leq b_1a_i$ for $1\\leq i\\leq \\alpha(G_1)$, ","authors_text":"Bao-Xuan Zhu, Qinglin Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T09:11:15Z","title":"Unimodality of the independence polynomials of some composite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05754","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:9a9e89b4cf524dfbe00c23354f1a7f3d5cef3d38a8448ce708bf0d4122035185","target":"record","created_at":"2026-05-18T01:36:32Z","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":"595d13a5d0f62e7eafb1aefb7fef4169dc4c239dc69e1a914565ceffc06005c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-21T09:11:15Z","title_canon_sha256":"6f8db99a6019e2201682333eef74bae3fe16301e3728490509ec22e46b2707f4"},"schema_version":"1.0","source":{"id":"1507.05754","kind":"arxiv","version":1}},"canonical_sha256":"1f3e3490699e2e533e37d9478a79189067435ed1381bb49d71eb2e6539d49035","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f3e3490699e2e533e37d9478a79189067435ed1381bb49d71eb2e6539d49035","first_computed_at":"2026-05-18T01:36:32.574760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:32.574760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"THRC86yAS6Fdd8NQ4cEMPPpoM+tdDOA5AbMufc98BVrq9dbgDv2S6zJ9PjA1asz8xOkkzJh3MyCc0yHEnIH8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:32.575599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a9e89b4cf524dfbe00c23354f1a7f3d5cef3d38a8448ce708bf0d4122035185","sha256:50a04b68381a890158325ded5263f93f897b84963e83bfbd1517bcfecbfb1f21"],"state_sha256":"ea5225a31fb2bb6a644a57384e12fdd2734a8dfbbf30208166756709b8774d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttk9DC4r4N1lGZEHyIJGChW19isdcu+0rDb8dfdCEFDucFDPEQshbDg2v2seY3DrQdIq/ktIy3zcujtceOuQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:04:11.727993Z","bundle_sha256":"fd645e7277d4a1857071cafb0a1da9f191fdac7c805a40873ec2aa886148abda"}}